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

Theorem rankuni 9792
Description: The rank of a union. Part of Exercise 4 of [Kunen] p. 107. (Contributed by NM, 15-Sep-2006.) (Revised by Mario Carneiro, 17-Nov-2014.)
Assertion
Ref Expression
rankuni (rank‘ 𝐴) = (rank‘𝐴)

Proof of Theorem rankuni
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 unieq 4878 . . . . 5 (𝑥 = 𝐴 𝑥 = 𝐴)
21fveq2d 6844 . . . 4 (𝑥 = 𝐴 → (rank‘ 𝑥) = (rank‘ 𝐴))
3 fveq2 6840 . . . . 5 (𝑥 = 𝐴 → (rank‘𝑥) = (rank‘𝐴))
43unieqd 4880 . . . 4 (𝑥 = 𝐴 (rank‘𝑥) = (rank‘𝐴))
52, 4eqeq12d 2745 . . 3 (𝑥 = 𝐴 → ((rank‘ 𝑥) = (rank‘𝑥) ↔ (rank‘ 𝐴) = (rank‘𝐴)))
6 vex 3448 . . . . . . 7 𝑥 ∈ V
76rankuni2 9784 . . . . . 6 (rank‘ 𝑥) = 𝑧𝑥 (rank‘𝑧)
8 fvex 6853 . . . . . . 7 (rank‘𝑧) ∈ V
98dfiun2 4992 . . . . . 6 𝑧𝑥 (rank‘𝑧) = {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)}
107, 9eqtri 2752 . . . . 5 (rank‘ 𝑥) = {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)}
11 df-rex 3054 . . . . . . . 8 (∃𝑧𝑥 𝑦 = (rank‘𝑧) ↔ ∃𝑧(𝑧𝑥𝑦 = (rank‘𝑧)))
126rankel 9768 . . . . . . . . . . 11 (𝑧𝑥 → (rank‘𝑧) ∈ (rank‘𝑥))
1312anim1i 615 . . . . . . . . . 10 ((𝑧𝑥𝑦 = (rank‘𝑧)) → ((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
1413eximi 1835 . . . . . . . . 9 (∃𝑧(𝑧𝑥𝑦 = (rank‘𝑧)) → ∃𝑧((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
15 19.42v 1953 . . . . . . . . . 10 (∃𝑧(𝑦 ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ (𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)))
16 eleq1 2816 . . . . . . . . . . . 12 (𝑦 = (rank‘𝑧) → (𝑦 ∈ (rank‘𝑥) ↔ (rank‘𝑧) ∈ (rank‘𝑥)))
1716pm5.32ri 575 . . . . . . . . . . 11 ((𝑦 ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ ((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
1817exbii 1848 . . . . . . . . . 10 (∃𝑧(𝑦 ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ ∃𝑧((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
19 simpl 482 . . . . . . . . . . 11 ((𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)) → 𝑦 ∈ (rank‘𝑥))
20 rankon 9724 . . . . . . . . . . . . . . . . 17 (rank‘𝑥) ∈ On
2120oneli 6436 . . . . . . . . . . . . . . . 16 (𝑦 ∈ (rank‘𝑥) → 𝑦 ∈ On)
22 r1fnon 9696 . . . . . . . . . . . . . . . . 17 𝑅1 Fn On
23 fndm 6603 . . . . . . . . . . . . . . . . 17 (𝑅1 Fn On → dom 𝑅1 = On)
2422, 23ax-mp 5 . . . . . . . . . . . . . . . 16 dom 𝑅1 = On
2521, 24eleqtrrdi 2839 . . . . . . . . . . . . . . 15 (𝑦 ∈ (rank‘𝑥) → 𝑦 ∈ dom 𝑅1)
26 rankr1id 9791 . . . . . . . . . . . . . . 15 (𝑦 ∈ dom 𝑅1 ↔ (rank‘(𝑅1𝑦)) = 𝑦)
2725, 26sylib 218 . . . . . . . . . . . . . 14 (𝑦 ∈ (rank‘𝑥) → (rank‘(𝑅1𝑦)) = 𝑦)
2827eqcomd 2735 . . . . . . . . . . . . 13 (𝑦 ∈ (rank‘𝑥) → 𝑦 = (rank‘(𝑅1𝑦)))
29 fvex 6853 . . . . . . . . . . . . . 14 (𝑅1𝑦) ∈ V
30 fveq2 6840 . . . . . . . . . . . . . . 15 (𝑧 = (𝑅1𝑦) → (rank‘𝑧) = (rank‘(𝑅1𝑦)))
3130eqeq2d 2740 . . . . . . . . . . . . . 14 (𝑧 = (𝑅1𝑦) → (𝑦 = (rank‘𝑧) ↔ 𝑦 = (rank‘(𝑅1𝑦))))
3229, 31spcev 3569 . . . . . . . . . . . . 13 (𝑦 = (rank‘(𝑅1𝑦)) → ∃𝑧 𝑦 = (rank‘𝑧))
3328, 32syl 17 . . . . . . . . . . . 12 (𝑦 ∈ (rank‘𝑥) → ∃𝑧 𝑦 = (rank‘𝑧))
3433ancli 548 . . . . . . . . . . 11 (𝑦 ∈ (rank‘𝑥) → (𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)))
3519, 34impbii 209 . . . . . . . . . 10 ((𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)) ↔ 𝑦 ∈ (rank‘𝑥))
3615, 18, 353bitr3i 301 . . . . . . . . 9 (∃𝑧((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ 𝑦 ∈ (rank‘𝑥))
3714, 36sylib 218 . . . . . . . 8 (∃𝑧(𝑧𝑥𝑦 = (rank‘𝑧)) → 𝑦 ∈ (rank‘𝑥))
3811, 37sylbi 217 . . . . . . 7 (∃𝑧𝑥 𝑦 = (rank‘𝑧) → 𝑦 ∈ (rank‘𝑥))
3938abssi 4029 . . . . . 6 {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)} ⊆ (rank‘𝑥)
4039unissi 4876 . . . . 5 {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)} ⊆ (rank‘𝑥)
4110, 40eqsstri 3990 . . . 4 (rank‘ 𝑥) ⊆ (rank‘𝑥)
42 pwuni 4905 . . . . . . . 8 𝑥 ⊆ 𝒫 𝑥
43 vuniex 7695 . . . . . . . . . 10 𝑥 ∈ V
4443pwex 5330 . . . . . . . . 9 𝒫 𝑥 ∈ V
4544rankss 9778 . . . . . . . 8 (𝑥 ⊆ 𝒫 𝑥 → (rank‘𝑥) ⊆ (rank‘𝒫 𝑥))
4642, 45ax-mp 5 . . . . . . 7 (rank‘𝑥) ⊆ (rank‘𝒫 𝑥)
4743rankpw 9772 . . . . . . 7 (rank‘𝒫 𝑥) = suc (rank‘ 𝑥)
4846, 47sseqtri 3992 . . . . . 6 (rank‘𝑥) ⊆ suc (rank‘ 𝑥)
4948unissi 4876 . . . . 5 (rank‘𝑥) ⊆ suc (rank‘ 𝑥)
50 rankon 9724 . . . . . 6 (rank‘ 𝑥) ∈ On
5150onunisuci 6442 . . . . 5 suc (rank‘ 𝑥) = (rank‘ 𝑥)
5249, 51sseqtri 3992 . . . 4 (rank‘𝑥) ⊆ (rank‘ 𝑥)
5341, 52eqssi 3960 . . 3 (rank‘ 𝑥) = (rank‘𝑥)
545, 53vtoclg 3517 . 2 (𝐴 ∈ V → (rank‘ 𝐴) = (rank‘𝐴))
55 uniexb 7720 . . . . 5 (𝐴 ∈ V ↔ 𝐴 ∈ V)
56 fvprc 6832 . . . . 5 𝐴 ∈ V → (rank‘ 𝐴) = ∅)
5755, 56sylnbi 330 . . . 4 𝐴 ∈ V → (rank‘ 𝐴) = ∅)
58 uni0 4895 . . . 4 ∅ = ∅
5957, 58eqtr4di 2782 . . 3 𝐴 ∈ V → (rank‘ 𝐴) = ∅)
60 fvprc 6832 . . . 4 𝐴 ∈ V → (rank‘𝐴) = ∅)
6160unieqd 4880 . . 3 𝐴 ∈ V → (rank‘𝐴) = ∅)
6259, 61eqtr4d 2767 . 2 𝐴 ∈ V → (rank‘ 𝐴) = (rank‘𝐴))
6354, 62pm2.61i 182 1 (rank‘ 𝐴) = (rank‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 395   = wceq 1540  wex 1779  wcel 2109  {cab 2707  wrex 3053  Vcvv 3444  wss 3911  c0 4292  𝒫 cpw 4559   cuni 4867   ciun 4951  dom cdm 5631  Oncon0 6320  suc csuc 6322   Fn wfn 6494  cfv 6499  𝑅1cr1 9691  rankcrnk 9692
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-reg 9521  ax-inf2 9570
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7372  df-om 7823  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-r1 9693  df-rank 9694
This theorem is referenced by:  rankuniss  9795  rankbnd2  9798  rankxplim2  9809  rankxplim3  9810  rankxpsuc  9811  r1limwun  10665  hfuni  36165
  Copyright terms: Public domain W3C validator