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

Theorem rankxplim 9858
Description: The rank of a Cartesian product when the rank of the union of its arguments is a limit ordinal. Part of Exercise 4 of [Kunen] p. 107. See rankxpsuc 9861 for the successor case. (Contributed by NM, 19-Sep-2006.)
Hypotheses
Ref Expression
rankxplim.1 𝐴 ∈ V
rankxplim.2 𝐵 ∈ V
Assertion
Ref Expression
rankxplim ((Lim (rank‘(𝐴𝐵)) ∧ (𝐴 × 𝐵) ≠ ∅) → (rank‘(𝐴 × 𝐵)) = (rank‘(𝐴𝐵)))

Proof of Theorem rankxplim
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 pwuni 4913 . . . . . . . . . 10 𝑥, 𝑦⟩ ⊆ 𝒫 𝑥, 𝑦
2 vex 3461 . . . . . . . . . . . 12 𝑥 ∈ V
3 vex 3461 . . . . . . . . . . . 12 𝑦 ∈ V
42, 3uniop 5500 . . . . . . . . . . 11 𝑥, 𝑦⟩ = {𝑥, 𝑦}
54pweqi 4580 . . . . . . . . . 10 𝒫 𝑥, 𝑦⟩ = 𝒫 {𝑥, 𝑦}
61, 5sseqtri 3986 . . . . . . . . 9 𝑥, 𝑦⟩ ⊆ 𝒫 {𝑥, 𝑦}
7 pwuni 4913 . . . . . . . . . . 11 {𝑥, 𝑦} ⊆ 𝒫 {𝑥, 𝑦}
82, 3unipr 4891 . . . . . . . . . . . 12 {𝑥, 𝑦} = (𝑥𝑦)
98pweqi 4580 . . . . . . . . . . 11 𝒫 {𝑥, 𝑦} = 𝒫 (𝑥𝑦)
107, 9sseqtri 3986 . . . . . . . . . 10 {𝑥, 𝑦} ⊆ 𝒫 (𝑥𝑦)
1110sspwi 4576 . . . . . . . . 9 𝒫 {𝑥, 𝑦} ⊆ 𝒫 𝒫 (𝑥𝑦)
126, 11sstri 3947 . . . . . . . 8 𝑥, 𝑦⟩ ⊆ 𝒫 𝒫 (𝑥𝑦)
132, 3unex 7752 . . . . . . . . . . 11 (𝑥𝑦) ∈ V
1413pwex 5353 . . . . . . . . . 10 𝒫 (𝑥𝑦) ∈ V
1514pwex 5353 . . . . . . . . 9 𝒫 𝒫 (𝑥𝑦) ∈ V
1615rankss 9828 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ⊆ 𝒫 𝒫 (𝑥𝑦) → (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘𝒫 𝒫 (𝑥𝑦)))
1712, 16ax-mp 5 . . . . . . 7 (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘𝒫 𝒫 (𝑥𝑦))
18 rankxplim.1 . . . . . . . . . . 11 𝐴 ∈ V
1918rankel 9818 . . . . . . . . . 10 (𝑥𝐴 → (rank‘𝑥) ∈ (rank‘𝐴))
20 rankxplim.2 . . . . . . . . . . 11 𝐵 ∈ V
2120rankel 9818 . . . . . . . . . 10 (𝑦𝐵 → (rank‘𝑦) ∈ (rank‘𝐵))
222, 3, 18, 20rankelun 9851 . . . . . . . . . 10 (((rank‘𝑥) ∈ (rank‘𝐴) ∧ (rank‘𝑦) ∈ (rank‘𝐵)) → (rank‘(𝑥𝑦)) ∈ (rank‘(𝐴𝐵)))
2319, 21, 22syl2an 608 . . . . . . . . 9 ((𝑥𝐴𝑦𝐵) → (rank‘(𝑥𝑦)) ∈ (rank‘(𝐴𝐵)))
2423adantl 487 . . . . . . . 8 ((Lim (rank‘(𝐴𝐵)) ∧ (𝑥𝐴𝑦𝐵)) → (rank‘(𝑥𝑦)) ∈ (rank‘(𝐴𝐵)))
25 ranklim 9823 . . . . . . . . . 10 (Lim (rank‘(𝐴𝐵)) → ((rank‘(𝑥𝑦)) ∈ (rank‘(𝐴𝐵)) ↔ (rank‘𝒫 (𝑥𝑦)) ∈ (rank‘(𝐴𝐵))))
26 ranklim 9823 . . . . . . . . . 10 (Lim (rank‘(𝐴𝐵)) → ((rank‘𝒫 (𝑥𝑦)) ∈ (rank‘(𝐴𝐵)) ↔ (rank‘𝒫 𝒫 (𝑥𝑦)) ∈ (rank‘(𝐴𝐵))))
2725, 26bitrd 282 . . . . . . . . 9 (Lim (rank‘(𝐴𝐵)) → ((rank‘(𝑥𝑦)) ∈ (rank‘(𝐴𝐵)) ↔ (rank‘𝒫 𝒫 (𝑥𝑦)) ∈ (rank‘(𝐴𝐵))))
2827adantr 486 . . . . . . . 8 ((Lim (rank‘(𝐴𝐵)) ∧ (𝑥𝐴𝑦𝐵)) → ((rank‘(𝑥𝑦)) ∈ (rank‘(𝐴𝐵)) ↔ (rank‘𝒫 𝒫 (𝑥𝑦)) ∈ (rank‘(𝐴𝐵))))
2924, 28mpbid 235 . . . . . . 7 ((Lim (rank‘(𝐴𝐵)) ∧ (𝑥𝐴𝑦𝐵)) → (rank‘𝒫 𝒫 (𝑥𝑦)) ∈ (rank‘(𝐴𝐵)))
30 rankon 9774 . . . . . . . 8 (rank‘⟨𝑥, 𝑦⟩) ∈ On
31 rankon 9774 . . . . . . . 8 (rank‘(𝐴𝐵)) ∈ On
32 ontr2 6413 . . . . . . . 8 (((rank‘⟨𝑥, 𝑦⟩) ∈ On ∧ (rank‘(𝐴𝐵)) ∈ On) → (((rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘𝒫 𝒫 (𝑥𝑦)) ∧ (rank‘𝒫 𝒫 (𝑥𝑦)) ∈ (rank‘(𝐴𝐵))) → (rank‘⟨𝑥, 𝑦⟩) ∈ (rank‘(𝐴𝐵))))
3330, 31, 32mp2an 705 . . . . . . 7 (((rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘𝒫 𝒫 (𝑥𝑦)) ∧ (rank‘𝒫 𝒫 (𝑥𝑦)) ∈ (rank‘(𝐴𝐵))) → (rank‘⟨𝑥, 𝑦⟩) ∈ (rank‘(𝐴𝐵)))
3417, 29, 33sylancr 599 . . . . . 6 ((Lim (rank‘(𝐴𝐵)) ∧ (𝑥𝐴𝑦𝐵)) → (rank‘⟨𝑥, 𝑦⟩) ∈ (rank‘(𝐴𝐵)))
3530, 31onsucssi 7843 . . . . . 6 ((rank‘⟨𝑥, 𝑦⟩) ∈ (rank‘(𝐴𝐵)) ↔ suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴𝐵)))
3634, 35sylib 221 . . . . 5 ((Lim (rank‘(𝐴𝐵)) ∧ (𝑥𝐴𝑦𝐵)) → suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴𝐵)))
3736ralrimivva 3210 . . . 4 (Lim (rank‘(𝐴𝐵)) → ∀𝑥𝐴𝑦𝐵 suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴𝐵)))
38 fveq2 6885 . . . . . . . 8 (𝑧 = ⟨𝑥, 𝑦⟩ → (rank‘𝑧) = (rank‘⟨𝑥, 𝑦⟩))
39 suceq 6433 . . . . . . . 8 ((rank‘𝑧) = (rank‘⟨𝑥, 𝑦⟩) → suc (rank‘𝑧) = suc (rank‘⟨𝑥, 𝑦⟩))
4038, 39syl 18 . . . . . . 7 (𝑧 = ⟨𝑥, 𝑦⟩ → suc (rank‘𝑧) = suc (rank‘⟨𝑥, 𝑦⟩))
4140sseq1d 3969 . . . . . 6 (𝑧 = ⟨𝑥, 𝑦⟩ → (suc (rank‘𝑧) ⊆ (rank‘(𝐴𝐵)) ↔ suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴𝐵))))
4241ralxp 5829 . . . . 5 (∀𝑧 ∈ (𝐴 × 𝐵)suc (rank‘𝑧) ⊆ (rank‘(𝐴𝐵)) ↔ ∀𝑥𝐴𝑦𝐵 suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴𝐵)))
4318, 20xpex 7758 . . . . . 6 (𝐴 × 𝐵) ∈ V
4443rankbnd 9847 . . . . 5 (∀𝑧 ∈ (𝐴 × 𝐵)suc (rank‘𝑧) ⊆ (rank‘(𝐴𝐵)) ↔ (rank‘(𝐴 × 𝐵)) ⊆ (rank‘(𝐴𝐵)))
4542, 44bitr3i 280 . . . 4 (∀𝑥𝐴𝑦𝐵 suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴𝐵)) ↔ (rank‘(𝐴 × 𝐵)) ⊆ (rank‘(𝐴𝐵)))
4637, 45sylib 221 . . 3 (Lim (rank‘(𝐴𝐵)) → (rank‘(𝐴 × 𝐵)) ⊆ (rank‘(𝐴𝐵)))
4746adantr 486 . 2 ((Lim (rank‘(𝐴𝐵)) ∧ (𝐴 × 𝐵) ≠ ∅) → (rank‘(𝐴 × 𝐵)) ⊆ (rank‘(𝐴𝐵)))
4818, 20rankxpl 9854 . . 3 ((𝐴 × 𝐵) ≠ ∅ → (rank‘(𝐴𝐵)) ⊆ (rank‘(𝐴 × 𝐵)))
4948adantl 487 . 2 ((Lim (rank‘(𝐴𝐵)) ∧ (𝐴 × 𝐵) ≠ ∅) → (rank‘(𝐴𝐵)) ⊆ (rank‘(𝐴 × 𝐵)))
5047, 49eqssd 3955 1 ((Lim (rank‘(𝐴𝐵)) ∧ (𝐴 × 𝐵) ≠ ∅) → (rank‘(𝐴 × 𝐵)) = (rank‘(𝐴𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wne 2960  wral 3081  Vcvv 3457  cun 3904  wss 3906  c0 4286  𝒫 cpw 4564  {cpr 4593  cop 4597   cuni 4874   × cxp 5661  Oncon0 6364  Lim wlim 6365  suc csuc 6366  cfv 6540  rankcrnk 9742
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-reg 9561  ax-inf2 9617
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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-om 7869  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-r1 9743  df-rank 9744
This theorem is used by:  rankxplim3  9860
  Copyright terms: Public domain W3C validator