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

Theorem rankuni 9782
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 4852 . . . . 5 (𝑥 = 𝐴 𝑥 = 𝐴)
21fveq2d 6835 . . . 4 (𝑥 = 𝐴 → (rank‘ 𝑥) = (rank‘ 𝐴))
3 fveq2 6831 . . . . 5 (𝑥 = 𝐴 → (rank‘𝑥) = (rank‘𝐴))
43unieqd 4854 . . . 4 (𝑥 = 𝐴 (rank‘𝑥) = (rank‘𝐴))
52, 4eqeq12d 2757 . . 3 (𝑥 = 𝐴 → ((rank‘ 𝑥) = (rank‘𝑥) ↔ (rank‘ 𝐴) = (rank‘𝐴)))
6 vex 3437 . . . . . . 7 𝑥 ∈ V
76rankuni2 9774 . . . . . 6 (rank‘ 𝑥) = 𝑧𝑥 (rank‘𝑧)
8 fvex 6844 . . . . . . 7 (rank‘𝑧) ∈ V
98dfiun2 4964 . . . . . 6 𝑧𝑥 (rank‘𝑧) = {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)}
107, 9eqtri 2764 . . . . 5 (rank‘ 𝑥) = {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)}
11 df-rex 3066 . . . . . . . 8 (∃𝑧𝑥 𝑦 = (rank‘𝑧) ↔ ∃𝑧(𝑧𝑥𝑦 = (rank‘𝑧)))
126rankel 9758 . . . . . . . . . . 11 (𝑧𝑥 → (rank‘𝑧) ∈ (rank‘𝑥))
1312anim1i 622 . . . . . . . . . 10 ((𝑧𝑥𝑦 = (rank‘𝑧)) → ((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
1413eximi 1843 . . . . . . . . 9 (∃𝑧(𝑧𝑥𝑦 = (rank‘𝑧)) → ∃𝑧((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
15 19.42v 1961 . . . . . . . . . 10 (∃𝑧(𝑦 ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ (𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)))
16 eleq1 2829 . . . . . . . . . . . 12 (𝑦 = (rank‘𝑧) → (𝑦 ∈ (rank‘𝑥) ↔ (rank‘𝑧) ∈ (rank‘𝑥)))
1716pm5.32ri 581 . . . . . . . . . . 11 ((𝑦 ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ ((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
1817exbii 1856 . . . . . . . . . 10 (∃𝑧(𝑦 ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ ∃𝑧((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
19 simpl 484 . . . . . . . . . . 11 ((𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)) → 𝑦 ∈ (rank‘𝑥))
20 rankon 9714 . . . . . . . . . . . . . . . . 17 (rank‘𝑥) ∈ On
2120oneli 6429 . . . . . . . . . . . . . . . 16 (𝑦 ∈ (rank‘𝑥) → 𝑦 ∈ On)
22 r1fnon 9686 . . . . . . . . . . . . . . . . 17 𝑅1 Fn On
23 fndm 6592 . . . . . . . . . . . . . . . . 17 (𝑅1 Fn On → dom 𝑅1 = On)
2422, 23ax-mp 5 . . . . . . . . . . . . . . . 16 dom 𝑅1 = On
2521, 24eleqtrrdi 2852 . . . . . . . . . . . . . . 15 (𝑦 ∈ (rank‘𝑥) → 𝑦 ∈ dom 𝑅1)
26 rankr1id 9781 . . . . . . . . . . . . . . 15 (𝑦 ∈ dom 𝑅1 ↔ (rank‘(𝑅1𝑦)) = 𝑦)
2725, 26sylib 220 . . . . . . . . . . . . . 14 (𝑦 ∈ (rank‘𝑥) → (rank‘(𝑅1𝑦)) = 𝑦)
2827eqcomd 2747 . . . . . . . . . . . . 13 (𝑦 ∈ (rank‘𝑥) → 𝑦 = (rank‘(𝑅1𝑦)))
29 fvex 6844 . . . . . . . . . . . . . 14 (𝑅1𝑦) ∈ V
30 fveq2 6831 . . . . . . . . . . . . . . 15 (𝑧 = (𝑅1𝑦) → (rank‘𝑧) = (rank‘(𝑅1𝑦)))
3130eqeq2d 2752 . . . . . . . . . . . . . 14 (𝑧 = (𝑅1𝑦) → (𝑦 = (rank‘𝑧) ↔ 𝑦 = (rank‘(𝑅1𝑦))))
3229, 31spcev 3546 . . . . . . . . . . . . 13 (𝑦 = (rank‘(𝑅1𝑦)) → ∃𝑧 𝑦 = (rank‘𝑧))
3328, 32syl 17 . . . . . . . . . . . 12 (𝑦 ∈ (rank‘𝑥) → ∃𝑧 𝑦 = (rank‘𝑧))
3433ancli 554 . . . . . . . . . . 11 (𝑦 ∈ (rank‘𝑥) → (𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)))
3519, 34impbii 211 . . . . . . . . . 10 ((𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)) ↔ 𝑦 ∈ (rank‘𝑥))
3615, 18, 353bitr3i 303 . . . . . . . . 9 (∃𝑧((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ 𝑦 ∈ (rank‘𝑥))
3714, 36sylib 220 . . . . . . . 8 (∃𝑧(𝑧𝑥𝑦 = (rank‘𝑧)) → 𝑦 ∈ (rank‘𝑥))
3811, 37sylbi 219 . . . . . . 7 (∃𝑧𝑥 𝑦 = (rank‘𝑧) → 𝑦 ∈ (rank‘𝑥))
3938abssi 4002 . . . . . 6 {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)} ⊆ (rank‘𝑥)
4039unissi 4850 . . . . 5 {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)} ⊆ (rank‘𝑥)
4110, 40eqsstri 3963 . . . 4 (rank‘ 𝑥) ⊆ (rank‘𝑥)
42 pwuni 4879 . . . . . . . 8 𝑥 ⊆ 𝒫 𝑥
43 vuniex 7686 . . . . . . . . . 10 𝑥 ∈ V
4443pwex 5312 . . . . . . . . 9 𝒫 𝑥 ∈ V
4544rankss 9768 . . . . . . . 8 (𝑥 ⊆ 𝒫 𝑥 → (rank‘𝑥) ⊆ (rank‘𝒫 𝑥))
4642, 45ax-mp 5 . . . . . . 7 (rank‘𝑥) ⊆ (rank‘𝒫 𝑥)
4743rankpw 9762 . . . . . . 7 (rank‘𝒫 𝑥) = suc (rank‘ 𝑥)
4846, 47sseqtri 3965 . . . . . 6 (rank‘𝑥) ⊆ suc (rank‘ 𝑥)
4948unissi 4850 . . . . 5 (rank‘𝑥) ⊆ suc (rank‘ 𝑥)
50 rankon 9714 . . . . . 6 (rank‘ 𝑥) ∈ On
5150onunisuci 6435 . . . . 5 suc (rank‘ 𝑥) = (rank‘ 𝑥)
5249, 51sseqtri 3965 . . . 4 (rank‘𝑥) ⊆ (rank‘ 𝑥)
5341, 52eqssi 3933 . . 3 (rank‘ 𝑥) = (rank‘𝑥)
545, 53vtoclg 3502 . 2 (𝐴 ∈ V → (rank‘ 𝐴) = (rank‘𝐴))
55 uniexb 7711 . . . . 5 (𝐴 ∈ V ↔ 𝐴 ∈ V)
56 fvprc 6823 . . . . 5 𝐴 ∈ V → (rank‘ 𝐴) = ∅)
5755, 56sylnbi 332 . . . 4 𝐴 ∈ V → (rank‘ 𝐴) = ∅)
58 uni0 4869 . . . 4 ∅ = ∅
5957, 58eqtr4di 2794 . . 3 𝐴 ∈ V → (rank‘ 𝐴) = ∅)
60 fvprc 6823 . . . 4 𝐴 ∈ V → (rank‘𝐴) = ∅)
6160unieqd 4854 . . 3 𝐴 ∈ V → (rank‘𝐴) = ∅)
6259, 61eqtr4d 2779 . 2 𝐴 ∈ V → (rank‘ 𝐴) = (rank‘𝐴))
6354, 62pm2.61i 183 1 (rank‘ 𝐴) = (rank‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 397   = wceq 1548  wex 1787  wcel 2121  {cab 2719  wrex 3065  Vcvv 3433  wss 3885  c0 4264  𝒫 cpw 4532   cuni 4841   ciun 4924  dom cdm 5621  Oncon0 6314  suc csuc 6316   Fn wfn 6484  cfv 6489  𝑅1cr1 9681  rankcrnk 9682
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5202  ax-sep 5221  ax-nul 5231  ax-pow 5297  ax-pr 5365  ax-un 7682  ax-reg 9501  ax-inf2 9557
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-int 4881  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7363  df-om 7811  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-r1 9683  df-rank 9684
This theorem is referenced by:  rankuniss  9785  rankbnd2  9788  rankxplim2  9799  rankxplim3  9800  rankxpsuc  9801  r1limwun  10654  hfuni  36427
  Copyright terms: Public domain W3C validator