Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  aomclem7 Unicode version

Theorem aomclem7 27260
Description: Lemma for dfac11 27263. 
( R1 `  A
) is well-orderable. (Contributed by Stefan O'Rear, 20-Jan-2015.)
Hypotheses
Ref Expression
aomclem6.b  |-  B  =  { <. a ,  b
>.  |  E. c  e.  ( R1 `  U. dom  z ) ( ( c  e.  b  /\  -.  c  e.  a
)  /\  A. d  e.  ( R1 `  U. dom  z ) ( d ( z `  U. dom  z ) c  -> 
( d  e.  a  <-> 
d  e.  b ) ) ) }
aomclem6.c  |-  C  =  ( a  e.  _V  |->  sup ( ( y `  a ) ,  ( R1 `  dom  z
) ,  B ) )
aomclem6.d  |-  D  = recs ( ( a  e. 
_V  |->  ( C `  ( ( R1 `  dom  z )  \  ran  a ) ) ) )
aomclem6.e  |-  E  =  { <. a ,  b
>.  |  |^| ( `' D " { a } )  e.  |^| ( `' D " { b } ) }
aomclem6.f  |-  F  =  { <. a ,  b
>.  |  ( ( rank `  a )  _E  ( rank `  b
)  \/  ( (
rank `  a )  =  ( rank `  b
)  /\  a (
z `  suc  ( rank `  a ) ) b ) ) }
aomclem6.g  |-  G  =  ( if ( dom  z  =  U. dom  z ,  F ,  E )  i^i  (
( R1 `  dom  z )  X.  ( R1 `  dom  z ) ) )
aomclem6.h  |-  H  = recs ( ( z  e. 
_V  |->  G ) )
aomclem6.a  |-  ( ph  ->  A  e.  On )
aomclem6.y  |-  ( ph  ->  A. a  e.  ~P  ( R1 `  A ) ( a  =/=  (/)  ->  (
y `  a )  e.  ( ( ~P a  i^i  Fin )  \  { (/)
} ) ) )
Assertion
Ref Expression
aomclem7  |-  ( ph  ->  E. b  b  We  ( R1 `  A
) )
Distinct variable groups:    y, z,
a, b, c, d    ph, a, b, c, d, z    C, a, b, c, d    D, a, b, c, d    A, a, b, c, d, z    H, a, b, c, d, z    G, d
Allowed substitution hints:    ph( y)    A( y)    B( y, z, a, b, c, d)    C( y, z)    D( y, z)    E( y, z, a, b, c, d)    F( y, z, a, b, c, d)    G( y, z, a, b, c)    H( y)

Proof of Theorem aomclem7
StepHypRef Expression
1 aomclem6.b . . 3  |-  B  =  { <. a ,  b
>.  |  E. c  e.  ( R1 `  U. dom  z ) ( ( c  e.  b  /\  -.  c  e.  a
)  /\  A. d  e.  ( R1 `  U. dom  z ) ( d ( z `  U. dom  z ) c  -> 
( d  e.  a  <-> 
d  e.  b ) ) ) }
2 aomclem6.c . . 3  |-  C  =  ( a  e.  _V  |->  sup ( ( y `  a ) ,  ( R1 `  dom  z
) ,  B ) )
3 aomclem6.d . . 3  |-  D  = recs ( ( a  e. 
_V  |->  ( C `  ( ( R1 `  dom  z )  \  ran  a ) ) ) )
4 aomclem6.e . . 3  |-  E  =  { <. a ,  b
>.  |  |^| ( `' D " { a } )  e.  |^| ( `' D " { b } ) }
5 aomclem6.f . . 3  |-  F  =  { <. a ,  b
>.  |  ( ( rank `  a )  _E  ( rank `  b
)  \/  ( (
rank `  a )  =  ( rank `  b
)  /\  a (
z `  suc  ( rank `  a ) ) b ) ) }
6 aomclem6.g . . 3  |-  G  =  ( if ( dom  z  =  U. dom  z ,  F ,  E )  i^i  (
( R1 `  dom  z )  X.  ( R1 `  dom  z ) ) )
7 aomclem6.h . . 3  |-  H  = recs ( ( z  e. 
_V  |->  G ) )
8 aomclem6.a . . 3  |-  ( ph  ->  A  e.  On )
9 aomclem6.y . . 3  |-  ( ph  ->  A. a  e.  ~P  ( R1 `  A ) ( a  =/=  (/)  ->  (
y `  a )  e.  ( ( ~P a  i^i  Fin )  \  { (/)
} ) ) )
101, 2, 3, 4, 5, 6, 7, 8, 9aomclem6 27259 . 2  |-  ( ph  ->  ( H `  A
)  We  ( R1
`  A ) )
11 fvex 5555 . . 3  |-  ( H `
 A )  e. 
_V
12 weeq1 4397 . . 3  |-  ( b  =  ( H `  A )  ->  (
b  We  ( R1
`  A )  <->  ( H `  A )  We  ( R1 `  A ) ) )
1311, 12spcev 2888 . 2  |-  ( ( H `  A )  We  ( R1 `  A )  ->  E. b 
b  We  ( R1
`  A ) )
1410, 13syl 15 1  |-  ( ph  ->  E. b  b  We  ( R1 `  A
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176    \/ wo 357    /\ wa 358   E.wex 1531    = wceq 1632    e. wcel 1696    =/= wne 2459   A.wral 2556   E.wrex 2557   _Vcvv 2801    \ cdif 3162    i^i cin 3164   (/)c0 3468   ifcif 3578   ~Pcpw 3638   {csn 3653   U.cuni 3843   |^|cint 3878   class class class wbr 4039   {copab 4092    e. cmpt 4093    _E cep 4319    We wwe 4367   Oncon0 4408   suc csuc 4410    X. cxp 4703   `'ccnv 4704   dom cdm 4705   ran crn 4706   "cima 4708   ` cfv 5271  recscrecs 6403   Fincfn 6879   supcsup 7209   R1cr1 7450   rankcrnk 7451
This theorem is referenced by:  aomclem8  27262
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-reu 2563  df-rmo 2564  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-int 3879  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-tr 4130  df-eprel 4321  df-id 4325  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-lim 4413  df-suc 4414  df-om 4673  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-isom 5280  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-1st 6138  df-2nd 6139  df-riota 6320  df-recs 6404  df-rdg 6439  df-1o 6495  df-2o 6496  df-er 6676  df-map 6790  df-en 6880  df-fin 6883  df-sup 7210  df-r1 7452  df-rank 7453
  Copyright terms: Public domain W3C validator