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

Theorem rankc2 9912
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 4909 . . . . 5 𝐴 ⊆ 𝒫 ∪ 𝐴
2 rankr1b.1 . . . . . . . 8 𝐴 ∈ V
32uniex 7779 . . . . . . 7 ∪ 𝐴 ∈ V
43pwex 5346 . . . . . 6 𝒫 ∪ 𝐴 ∈ V
54rankss 9887 . . . . 5 (𝐴 ⊆ 𝒫 ∪ 𝐴 → (rank‘𝐴) ⊆ (rank‘𝒫 ∪ 𝐴))
61, 5ax-mp 5 . . . 4 (rank‘𝐴) ⊆ (rank‘𝒫 ∪ 𝐴)
73rankpw 9880 . . . 4 (rank‘𝒫 ∪ 𝐴) = suc (rank‘∪ 𝐴)
86, 7sseqtri 3961 . . 3 (rank‘𝐴) ⊆ suc (rank‘∪ 𝐴)
98a1i 11 . 2 (∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘∪ 𝐴) → (rank‘𝐴) ⊆ suc (rank‘∪ 𝐴))
102rankel 9875 . . . . 5 (𝑥 ∈ 𝐴 → (rank‘𝑥) ∈ (rank‘𝐴))
11 eleq1 2852 . . . . 5 ((rank‘𝑥) = (rank‘∪ 𝐴) → ((rank‘𝑥) ∈ (rank‘𝐴) ↔ (rank‘∪ 𝐴) ∈ (rank‘𝐴)))
1210, 11syl5ibcom 248 . . . 4 (𝑥 ∈ 𝐴 → ((rank‘𝑥) = (rank‘∪ 𝐴) → (rank‘∪ 𝐴) ∈ (rank‘𝐴)))
1312rexlimiv 3160 . . 3 (∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘∪ 𝐴) → (rank‘∪ 𝐴) ∈ (rank‘𝐴))
14 rankon 9827 . . . 4 (rank‘∪ 𝐴) ∈ On
15 rankon 9827 . . . 4 (rank‘𝐴) ∈ On
1614, 15onsucssi 7873 . . 3 ((rank‘∪ 𝐴) ∈ (rank‘𝐴) ↔ suc (rank‘∪ 𝐴) ⊆ (rank‘𝐴))
1713, 16sylib 221 . 2 (∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘∪ 𝐴) → suc (rank‘∪ 𝐴) ⊆ (rank‘𝐴))
189, 17eqssd 3930 1 (∃𝑥 ∈ 𝐴 (rank‘𝑥) = (rank‘∪ 𝐴) → (rank‘𝐴) = suc (rank‘∪ 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900  𝒫 cpw 4560  ∪ cuni 4870  suc csuc 6379  ‘cfv 6555  rankcrnk 9791
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-reg 9610  ax-inf2 9666
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6319  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-om 7899  df-2nd 8023  df-frecs 8324  df-wrecs 8355  df-recs 8404  df-rdg 8443  df-r1 9792  df-rank 9793
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator