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

Theorem rankc2 8734
Description: A relationship that can be used for computation of rank. (Contributed by NM, 16-Sep-2006.)
Hypothesis
Ref Expression
rankr1b.1  |-  A  e. 
_V
Assertion
Ref Expression
rankc2  |-  ( E. x  e.  A  (
rank `  x )  =  ( rank `  U. A )  ->  ( rank `  A )  =  suc  ( rank `  U. A ) )
Distinct variable group:    x, A

Proof of Theorem rankc2
StepHypRef Expression
1 pwuni 4474 . . . . 5  |-  A  C_  ~P U. A
2 rankr1b.1 . . . . . . . 8  |-  A  e. 
_V
32uniex 6953 . . . . . . 7  |-  U. A  e.  _V
43pwex 4848 . . . . . 6  |-  ~P U. A  e.  _V
54rankss 8712 . . . . 5  |-  ( A 
C_  ~P U. A  -> 
( rank `  A )  C_  ( rank `  ~P U. A ) )
61, 5ax-mp 5 . . . 4  |-  ( rank `  A )  C_  ( rank `  ~P U. A
)
73rankpw 8706 . . . 4  |-  ( rank `  ~P U. A )  =  suc  ( rank `  U. A )
86, 7sseqtri 3637 . . 3  |-  ( rank `  A )  C_  suc  ( rank `  U. A )
98a1i 11 . 2  |-  ( E. x  e.  A  (
rank `  x )  =  ( rank `  U. A )  ->  ( rank `  A )  C_  suc  ( rank `  U. A ) )
102rankel 8702 . . . . 5  |-  ( x  e.  A  ->  ( rank `  x )  e.  ( rank `  A
) )
11 eleq1 2689 . . . . 5  |-  ( (
rank `  x )  =  ( rank `  U. A )  ->  (
( rank `  x )  e.  ( rank `  A
)  <->  ( rank `  U. A )  e.  (
rank `  A )
) )
1210, 11syl5ibcom 235 . . . 4  |-  ( x  e.  A  ->  (
( rank `  x )  =  ( rank `  U. A )  ->  ( rank `  U. A )  e.  ( rank `  A
) ) )
1312rexlimiv 3027 . . 3  |-  ( E. x  e.  A  (
rank `  x )  =  ( rank `  U. A )  ->  ( rank `  U. A )  e.  ( rank `  A
) )
14 rankon 8658 . . . 4  |-  ( rank `  U. A )  e.  On
15 rankon 8658 . . . 4  |-  ( rank `  A )  e.  On
1614, 15onsucssi 7041 . . 3  |-  ( (
rank `  U. A )  e.  ( rank `  A
)  <->  suc  ( rank `  U. A )  C_  ( rank `  A ) )
1713, 16sylib 208 . 2  |-  ( E. x  e.  A  (
rank `  x )  =  ( rank `  U. A )  ->  suc  ( rank `  U. A ) 
C_  ( rank `  A
) )
189, 17eqssd 3620 1  |-  ( E. x  e.  A  (
rank `  x )  =  ( rank `  U. A )  ->  ( rank `  A )  =  suc  ( rank `  U. A ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    = wceq 1483    e. wcel 1990   E.wrex 2913   _Vcvv 3200    C_ wss 3574   ~Pcpw 4158   U.cuni 4436   suc csuc 5725   ` cfv 5888   rankcrnk 8626
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-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-reg 8497  ax-inf2 8538
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-om 7066  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-r1 8627  df-rank 8628
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator