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

Theorem aomclem7 27137
Description: Lemma for dfac11 27139. 
( 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 27136 . 2  |-  ( ph  ->  ( H `  A
)  We  ( R1
`  A ) )
11 fvex 5744 . . 3  |-  ( H `
 A )  e. 
_V
12 weeq1 4572 . . 3  |-  ( b  =  ( H `  A )  ->  (
b  We  ( R1
`  A )  <->  ( H `  A )  We  ( R1 `  A ) ) )
1311, 12spcev 3045 . 2  |-  ( ( H `  A )  We  ( R1 `  A )  ->  E. b 
b  We  ( R1
`  A ) )
1410, 13syl 16 1  |-  ( ph  ->  E. b  b  We  ( R1 `  A
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 178    \/ wo 359    /\ wa 360   E.wex 1551    = wceq 1653    e. wcel 1726    =/= wne 2601   A.wral 2707   E.wrex 2708   _Vcvv 2958    \ cdif 3319    i^i cin 3321   (/)c0 3630   ifcif 3741   ~Pcpw 3801   {csn 3816   U.cuni 4017   |^|cint 4052   class class class wbr 4214   {copab 4267    e. cmpt 4268    _E cep 4494    We wwe 4542   Oncon0 4583   suc csuc 4585    X. cxp 4878   `'ccnv 4879   dom cdm 4880   ran crn 4881   "cima 4883   ` cfv 5456  recscrecs 6634   Fincfn 7111   supcsup 7447   R1cr1 7690   rankcrnk 7691
This theorem is referenced by:  aomclem8  27138
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-rep 4322  ax-sep 4332  ax-nul 4340  ax-pow 4379  ax-pr 4405  ax-un 4703
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3or 938  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2287  df-mo 2288  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-ral 2712  df-rex 2713  df-reu 2714  df-rmo 2715  df-rab 2716  df-v 2960  df-sbc 3164  df-csb 3254  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-pss 3338  df-nul 3631  df-if 3742  df-pw 3803  df-sn 3822  df-pr 3823  df-tp 3824  df-op 3825  df-uni 4018  df-int 4053  df-iun 4097  df-br 4215  df-opab 4269  df-mpt 4270  df-tr 4305  df-eprel 4496  df-id 4500  df-po 4505  df-so 4506  df-fr 4543  df-we 4545  df-ord 4586  df-on 4587  df-lim 4588  df-suc 4589  df-om 4848  df-xp 4886  df-rel 4887  df-cnv 4888  df-co 4889  df-dm 4890  df-rn 4891  df-res 4892  df-ima 4893  df-iota 5420  df-fun 5458  df-fn 5459  df-f 5460  df-f1 5461  df-fo 5462  df-f1o 5463  df-fv 5464  df-isom 5465  df-ov 6086  df-oprab 6087  df-mpt2 6088  df-1st 6351  df-2nd 6352  df-riota 6551  df-recs 6635  df-rdg 6670  df-1o 6726  df-2o 6727  df-er 6907  df-map 7022  df-en 7112  df-fin 7115  df-sup 7448  df-r1 7692  df-rank 7693
  Copyright terms: Public domain W3C validator