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

Theorem rankuni 9621
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 4850 . . . . 5 (𝑥 = 𝐴 𝑥 = 𝐴)
21fveq2d 6778 . . . 4 (𝑥 = 𝐴 → (rank‘ 𝑥) = (rank‘ 𝐴))
3 fveq2 6774 . . . . 5 (𝑥 = 𝐴 → (rank‘𝑥) = (rank‘𝐴))
43unieqd 4853 . . . 4 (𝑥 = 𝐴 (rank‘𝑥) = (rank‘𝐴))
52, 4eqeq12d 2754 . . 3 (𝑥 = 𝐴 → ((rank‘ 𝑥) = (rank‘𝑥) ↔ (rank‘ 𝐴) = (rank‘𝐴)))
6 vex 3436 . . . . . . 7 𝑥 ∈ V
76rankuni2 9613 . . . . . 6 (rank‘ 𝑥) = 𝑧𝑥 (rank‘𝑧)
8 fvex 6787 . . . . . . 7 (rank‘𝑧) ∈ V
98dfiun2 4963 . . . . . 6 𝑧𝑥 (rank‘𝑧) = {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)}
107, 9eqtri 2766 . . . . 5 (rank‘ 𝑥) = {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)}
11 df-rex 3070 . . . . . . . 8 (∃𝑧𝑥 𝑦 = (rank‘𝑧) ↔ ∃𝑧(𝑧𝑥𝑦 = (rank‘𝑧)))
126rankel 9597 . . . . . . . . . . 11 (𝑧𝑥 → (rank‘𝑧) ∈ (rank‘𝑥))
1312anim1i 615 . . . . . . . . . 10 ((𝑧𝑥𝑦 = (rank‘𝑧)) → ((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
1413eximi 1837 . . . . . . . . 9 (∃𝑧(𝑧𝑥𝑦 = (rank‘𝑧)) → ∃𝑧((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
15 19.42v 1957 . . . . . . . . . 10 (∃𝑧(𝑦 ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ (𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)))
16 eleq1 2826 . . . . . . . . . . . 12 (𝑦 = (rank‘𝑧) → (𝑦 ∈ (rank‘𝑥) ↔ (rank‘𝑧) ∈ (rank‘𝑥)))
1716pm5.32ri 576 . . . . . . . . . . 11 ((𝑦 ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ ((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
1817exbii 1850 . . . . . . . . . 10 (∃𝑧(𝑦 ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ ∃𝑧((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)))
19 simpl 483 . . . . . . . . . . 11 ((𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)) → 𝑦 ∈ (rank‘𝑥))
20 rankon 9553 . . . . . . . . . . . . . . . . 17 (rank‘𝑥) ∈ On
2120oneli 6374 . . . . . . . . . . . . . . . 16 (𝑦 ∈ (rank‘𝑥) → 𝑦 ∈ On)
22 r1fnon 9525 . . . . . . . . . . . . . . . . 17 𝑅1 Fn On
23 fndm 6536 . . . . . . . . . . . . . . . . 17 (𝑅1 Fn On → dom 𝑅1 = On)
2422, 23ax-mp 5 . . . . . . . . . . . . . . . 16 dom 𝑅1 = On
2521, 24eleqtrrdi 2850 . . . . . . . . . . . . . . 15 (𝑦 ∈ (rank‘𝑥) → 𝑦 ∈ dom 𝑅1)
26 rankr1id 9620 . . . . . . . . . . . . . . 15 (𝑦 ∈ dom 𝑅1 ↔ (rank‘(𝑅1𝑦)) = 𝑦)
2725, 26sylib 217 . . . . . . . . . . . . . 14 (𝑦 ∈ (rank‘𝑥) → (rank‘(𝑅1𝑦)) = 𝑦)
2827eqcomd 2744 . . . . . . . . . . . . 13 (𝑦 ∈ (rank‘𝑥) → 𝑦 = (rank‘(𝑅1𝑦)))
29 fvex 6787 . . . . . . . . . . . . . 14 (𝑅1𝑦) ∈ V
30 fveq2 6774 . . . . . . . . . . . . . . 15 (𝑧 = (𝑅1𝑦) → (rank‘𝑧) = (rank‘(𝑅1𝑦)))
3130eqeq2d 2749 . . . . . . . . . . . . . 14 (𝑧 = (𝑅1𝑦) → (𝑦 = (rank‘𝑧) ↔ 𝑦 = (rank‘(𝑅1𝑦))))
3229, 31spcev 3545 . . . . . . . . . . . . 13 (𝑦 = (rank‘(𝑅1𝑦)) → ∃𝑧 𝑦 = (rank‘𝑧))
3328, 32syl 17 . . . . . . . . . . . 12 (𝑦 ∈ (rank‘𝑥) → ∃𝑧 𝑦 = (rank‘𝑧))
3433ancli 549 . . . . . . . . . . 11 (𝑦 ∈ (rank‘𝑥) → (𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)))
3519, 34impbii 208 . . . . . . . . . 10 ((𝑦 ∈ (rank‘𝑥) ∧ ∃𝑧 𝑦 = (rank‘𝑧)) ↔ 𝑦 ∈ (rank‘𝑥))
3615, 18, 353bitr3i 301 . . . . . . . . 9 (∃𝑧((rank‘𝑧) ∈ (rank‘𝑥) ∧ 𝑦 = (rank‘𝑧)) ↔ 𝑦 ∈ (rank‘𝑥))
3714, 36sylib 217 . . . . . . . 8 (∃𝑧(𝑧𝑥𝑦 = (rank‘𝑧)) → 𝑦 ∈ (rank‘𝑥))
3811, 37sylbi 216 . . . . . . 7 (∃𝑧𝑥 𝑦 = (rank‘𝑧) → 𝑦 ∈ (rank‘𝑥))
3938abssi 4003 . . . . . 6 {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)} ⊆ (rank‘𝑥)
4039unissi 4848 . . . . 5 {𝑦 ∣ ∃𝑧𝑥 𝑦 = (rank‘𝑧)} ⊆ (rank‘𝑥)
4110, 40eqsstri 3955 . . . 4 (rank‘ 𝑥) ⊆ (rank‘𝑥)
42 pwuni 4878 . . . . . . . 8 𝑥 ⊆ 𝒫 𝑥
43 vuniex 7592 . . . . . . . . . 10 𝑥 ∈ V
4443pwex 5303 . . . . . . . . 9 𝒫 𝑥 ∈ V
4544rankss 9607 . . . . . . . 8 (𝑥 ⊆ 𝒫 𝑥 → (rank‘𝑥) ⊆ (rank‘𝒫 𝑥))
4642, 45ax-mp 5 . . . . . . 7 (rank‘𝑥) ⊆ (rank‘𝒫 𝑥)
4743rankpw 9601 . . . . . . 7 (rank‘𝒫 𝑥) = suc (rank‘ 𝑥)
4846, 47sseqtri 3957 . . . . . 6 (rank‘𝑥) ⊆ suc (rank‘ 𝑥)
4948unissi 4848 . . . . 5 (rank‘𝑥) ⊆ suc (rank‘ 𝑥)
50 rankon 9553 . . . . . 6 (rank‘ 𝑥) ∈ On
5150onunisuci 6380 . . . . 5 suc (rank‘ 𝑥) = (rank‘ 𝑥)
5249, 51sseqtri 3957 . . . 4 (rank‘𝑥) ⊆ (rank‘ 𝑥)
5341, 52eqssi 3937 . . 3 (rank‘ 𝑥) = (rank‘𝑥)
545, 53vtoclg 3505 . 2 (𝐴 ∈ V → (rank‘ 𝐴) = (rank‘𝐴))
55 uniexb 7614 . . . . 5 (𝐴 ∈ V ↔ 𝐴 ∈ V)
56 fvprc 6766 . . . . 5 𝐴 ∈ V → (rank‘ 𝐴) = ∅)
5755, 56sylnbi 330 . . . 4 𝐴 ∈ V → (rank‘ 𝐴) = ∅)
58 uni0 4869 . . . 4 ∅ = ∅
5957, 58eqtr4di 2796 . . 3 𝐴 ∈ V → (rank‘ 𝐴) = ∅)
60 fvprc 6766 . . . 4 𝐴 ∈ V → (rank‘𝐴) = ∅)
6160unieqd 4853 . . 3 𝐴 ∈ V → (rank‘𝐴) = ∅)
6259, 61eqtr4d 2781 . 2 𝐴 ∈ V → (rank‘ 𝐴) = (rank‘𝐴))
6354, 62pm2.61i 182 1 (rank‘ 𝐴) = (rank‘𝐴)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wa 396   = wceq 1539  wex 1782  wcel 2106  {cab 2715  wrex 3065  Vcvv 3432  wss 3887  c0 4256  𝒫 cpw 4533   cuni 4839   ciun 4924  dom cdm 5589  Oncon0 6266  suc csuc 6268   Fn wfn 6428  cfv 6433  𝑅1cr1 9520  rankcrnk 9521
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-reg 9351  ax-inf2 9399
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-om 7713  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-r1 9522  df-rank 9523
This theorem is referenced by:  rankuniss  9624  rankbnd2  9627  rankxplim2  9638  rankxplim3  9639  rankxpsuc  9640  r1limwun  10492  hfuni  34486
  Copyright terms: Public domain W3C validator