MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  itg2lr Structured version   Visualization version   Unicode version

Theorem itg2lr 23497
Description: Sufficient condition for elementhood in the set  L. (Contributed by Mario Carneiro, 28-Jun-2014.)
Hypothesis
Ref Expression
itg2val.1  |-  L  =  { x  |  E. g  e.  dom  S.1 (
g  oR  <_  F  /\  x  =  ( S.1 `  g ) ) }
Assertion
Ref Expression
itg2lr  |-  ( ( G  e.  dom  S.1  /\  G  oR  <_  F )  ->  ( S.1 `  G )  e.  L )
Distinct variable groups:    x, g, F    g, G, x
Allowed substitution hints:    L( x, g)

Proof of Theorem itg2lr
StepHypRef Expression
1 eqid 2622 . . 3  |-  ( S.1 `  G )  =  ( S.1 `  G )
2 breq1 4656 . . . . 5  |-  ( g  =  G  ->  (
g  oR  <_  F 
<->  G  oR  <_  F ) )
3 fveq2 6191 . . . . . 6  |-  ( g  =  G  ->  ( S.1 `  g )  =  ( S.1 `  G
) )
43eqeq2d 2632 . . . . 5  |-  ( g  =  G  ->  (
( S.1 `  G )  =  ( S.1 `  g
)  <->  ( S.1 `  G
)  =  ( S.1 `  G ) ) )
52, 4anbi12d 747 . . . 4  |-  ( g  =  G  ->  (
( g  oR  <_  F  /\  ( S.1 `  G )  =  ( S.1 `  g
) )  <->  ( G  oR  <_  F  /\  ( S.1 `  G )  =  ( S.1 `  G
) ) ) )
65rspcev 3309 . . 3  |-  ( ( G  e.  dom  S.1  /\  ( G  oR  <_  F  /\  ( S.1 `  G )  =  ( S.1 `  G
) ) )  ->  E. g  e.  dom  S.1 ( g  oR  <_  F  /\  ( S.1 `  G )  =  ( S.1 `  g
) ) )
71, 6mpanr2 720 . 2  |-  ( ( G  e.  dom  S.1  /\  G  oR  <_  F )  ->  E. g  e.  dom  S.1 ( g  oR  <_  F  /\  ( S.1 `  G )  =  ( S.1 `  g
) ) )
8 itg2val.1 . . 3  |-  L  =  { x  |  E. g  e.  dom  S.1 (
g  oR  <_  F  /\  x  =  ( S.1 `  g ) ) }
98itg2l 23496 . 2  |-  ( ( S.1 `  G )  e.  L  <->  E. g  e.  dom  S.1 ( g  oR  <_  F  /\  ( S.1 `  G )  =  ( S.1 `  g
) ) )
107, 9sylibr 224 1  |-  ( ( G  e.  dom  S.1  /\  G  oR  <_  F )  ->  ( S.1 `  G )  e.  L )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 384    = wceq 1483    e. wcel 1990   {cab 2608   E.wrex 2913   class class class wbr 4653   dom cdm 5114   ` cfv 5888    oRcofr 6896    <_ cle 10075   S.1citg1 23384
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-nul 4789
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896
This theorem is referenced by:  itg2ub  23500
  Copyright terms: Public domain W3C validator