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

Theorem rankc2 9302
Description: A relationship that can be used for computation of rank. (Contributed by NM, 16-Sep-2006.)
Hypothesis
Ref Expression
rankr1b.1 𝐴 ∈ V
Assertion
Ref Expression
rankc2 (∃𝑥𝐴 (rank‘𝑥) = (rank‘ 𝐴) → (rank‘𝐴) = suc (rank‘ 𝐴))
Distinct variable group:   𝑥,𝐴

Proof of Theorem rankc2
StepHypRef Expression
1 pwuni 4877 . . . . 5 𝐴 ⊆ 𝒫 𝐴
2 rankr1b.1 . . . . . . . 8 𝐴 ∈ V
32uniex 7469 . . . . . . 7 𝐴 ∈ V
43pwex 5283 . . . . . 6 𝒫 𝐴 ∈ V
54rankss 9280 . . . . 5 (𝐴 ⊆ 𝒫 𝐴 → (rank‘𝐴) ⊆ (rank‘𝒫 𝐴))
61, 5ax-mp 5 . . . 4 (rank‘𝐴) ⊆ (rank‘𝒫 𝐴)
73rankpw 9274 . . . 4 (rank‘𝒫 𝐴) = suc (rank‘ 𝐴)
86, 7sseqtri 4005 . . 3 (rank‘𝐴) ⊆ suc (rank‘ 𝐴)
98a1i 11 . 2 (∃𝑥𝐴 (rank‘𝑥) = (rank‘ 𝐴) → (rank‘𝐴) ⊆ suc (rank‘ 𝐴))
102rankel 9270 . . . . 5 (𝑥𝐴 → (rank‘𝑥) ∈ (rank‘𝐴))
11 eleq1 2902 . . . . 5 ((rank‘𝑥) = (rank‘ 𝐴) → ((rank‘𝑥) ∈ (rank‘𝐴) ↔ (rank‘ 𝐴) ∈ (rank‘𝐴)))
1210, 11syl5ibcom 247 . . . 4 (𝑥𝐴 → ((rank‘𝑥) = (rank‘ 𝐴) → (rank‘ 𝐴) ∈ (rank‘𝐴)))
1312rexlimiv 3282 . . 3 (∃𝑥𝐴 (rank‘𝑥) = (rank‘ 𝐴) → (rank‘ 𝐴) ∈ (rank‘𝐴))
14 rankon 9226 . . . 4 (rank‘ 𝐴) ∈ On
15 rankon 9226 . . . 4 (rank‘𝐴) ∈ On
1614, 15onsucssi 7558 . . 3 ((rank‘ 𝐴) ∈ (rank‘𝐴) ↔ suc (rank‘ 𝐴) ⊆ (rank‘𝐴))
1713, 16sylib 220 . 2 (∃𝑥𝐴 (rank‘𝑥) = (rank‘ 𝐴) → suc (rank‘ 𝐴) ⊆ (rank‘𝐴))
189, 17eqssd 3986 1 (∃𝑥𝐴 (rank‘𝑥) = (rank‘ 𝐴) → (rank‘𝐴) = suc (rank‘ 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1537  wcel 2114  wrex 3141  Vcvv 3496  wss 3938  𝒫 cpw 4541   cuni 4840  suc csuc 6195  cfv 6357  rankcrnk 9194
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-reg 9058  ax-inf2 9106
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-om 7583  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-r1 9195  df-rank 9196
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator