Theorem rankxplim 9916

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 9919 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.

Step	Hyp	Ref	Expression
1		pwuni 4949	. . . . . . . . . 10 ⊢ ⟨𝑥, 𝑦⟩ ⊆ 𝒫 ∪ ⟨𝑥, 𝑦⟩
2		vex 3481	. . . . . . . . . . . 12 ⊢ 𝑥 ∈ V
3		vex 3481	. . . . . . . . . . . 12 ⊢ 𝑦 ∈ V
4	2, 3	uniop 5524	. . . . . . . . . . 11 ⊢ ∪ ⟨𝑥, 𝑦⟩ = {𝑥, 𝑦}
5	4	pweqi 4620	. . . . . . . . . 10 ⊢ 𝒫 ∪ ⟨𝑥, 𝑦⟩ = 𝒫 {𝑥, 𝑦}
6	1, 5	sseqtri 4031	. . . . . . . . 9 ⊢ ⟨𝑥, 𝑦⟩ ⊆ 𝒫 {𝑥, 𝑦}
7		pwuni 4949	. . . . . . . . . . 11 ⊢ {𝑥, 𝑦} ⊆ 𝒫 ∪ {𝑥, 𝑦}
8	2, 3	unipr 4928	. . . . . . . . . . . 12 ⊢ ∪ {𝑥, 𝑦} = (𝑥 ∪ 𝑦)
9	8	pweqi 4620	. . . . . . . . . . 11 ⊢ 𝒫 ∪ {𝑥, 𝑦} = 𝒫 (𝑥 ∪ 𝑦)
10	7, 9	sseqtri 4031	. . . . . . . . . 10 ⊢ {𝑥, 𝑦} ⊆ 𝒫 (𝑥 ∪ 𝑦)
11	10	sspwi 4616	. . . . . . . . 9 ⊢ 𝒫 {𝑥, 𝑦} ⊆ 𝒫 𝒫 (𝑥 ∪ 𝑦)
12	6, 11	sstri 4004	. . . . . . . 8 ⊢ ⟨𝑥, 𝑦⟩ ⊆ 𝒫 𝒫 (𝑥 ∪ 𝑦)
13	2, 3	unex 7762	. . . . . . . . . . 11 ⊢ (𝑥 ∪ 𝑦) ∈ V
14	13	pwex 5385	. . . . . . . . . 10 ⊢ 𝒫 (𝑥 ∪ 𝑦) ∈ V
15	14	pwex 5385	. . . . . . . . 9 ⊢ 𝒫 𝒫 (𝑥 ∪ 𝑦) ∈ V
16	15	rankss 9886	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ⊆ 𝒫 𝒫 (𝑥 ∪ 𝑦) → (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘𝒫 𝒫 (𝑥 ∪ 𝑦)))
17	12, 16	ax-mp 5	. . . . . . 7 ⊢ (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘𝒫 𝒫 (𝑥 ∪ 𝑦))
18		rankxplim.1	. . . . . . . . . . 11 ⊢ 𝐴 ∈ V
19	18	rankel 9876	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐴 → (rank‘𝑥) ∈ (rank‘𝐴))
20		rankxplim.2	. . . . . . . . . . 11 ⊢ 𝐵 ∈ V
21	20	rankel 9876	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐵 → (rank‘𝑦) ∈ (rank‘𝐵))
22	2, 3, 18, 20	rankelun 9909	. . . . . . . . . 10 ⊢ (((rank‘𝑥) ∈ (rank‘𝐴) ∧ (rank‘𝑦) ∈ (rank‘𝐵)) → (rank‘(𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵)))
23	19, 21, 22	syl2an 596	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (rank‘(𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵)))
24	23	adantl 481	. . . . . . . 8 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (rank‘(𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵)))
25		ranklim 9881	. . . . . . . . . 10 ⊢ (Lim (rank‘(𝐴 ∪ 𝐵)) → ((rank‘(𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵)) ↔ (rank‘𝒫 (𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵))))
26		ranklim 9881	. . . . . . . . . 10 ⊢ (Lim (rank‘(𝐴 ∪ 𝐵)) → ((rank‘𝒫 (𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵)) ↔ (rank‘𝒫 𝒫 (𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵))))
27	25, 26	bitrd 279	. . . . . . . . 9 ⊢ (Lim (rank‘(𝐴 ∪ 𝐵)) → ((rank‘(𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵)) ↔ (rank‘𝒫 𝒫 (𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵))))
28	27	adantr 480	. . . . . . . 8 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ((rank‘(𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵)) ↔ (rank‘𝒫 𝒫 (𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵))))
29	24, 28	mpbid 232	. . . . . . 7 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (rank‘𝒫 𝒫 (𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵)))
30		rankon 9832	. . . . . . . 8 ⊢ (rank‘⟨𝑥, 𝑦⟩) ∈ On
31		rankon 9832	. . . . . . . 8 ⊢ (rank‘(𝐴 ∪ 𝐵)) ∈ On
32		ontr2 6432	. . . . . . . 8 ⊢ (((rank‘⟨𝑥, 𝑦⟩) ∈ On ∧ (rank‘(𝐴 ∪ 𝐵)) ∈ On) → (((rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘𝒫 𝒫 (𝑥 ∪ 𝑦)) ∧ (rank‘𝒫 𝒫 (𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵))) → (rank‘⟨𝑥, 𝑦⟩) ∈ (rank‘(𝐴 ∪ 𝐵))))
33	30, 31, 32	mp2an 692	. . . . . . 7 ⊢ (((rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘𝒫 𝒫 (𝑥 ∪ 𝑦)) ∧ (rank‘𝒫 𝒫 (𝑥 ∪ 𝑦)) ∈ (rank‘(𝐴 ∪ 𝐵))) → (rank‘⟨𝑥, 𝑦⟩) ∈ (rank‘(𝐴 ∪ 𝐵)))
34	17, 29, 33	sylancr 587	. . . . . 6 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (rank‘⟨𝑥, 𝑦⟩) ∈ (rank‘(𝐴 ∪ 𝐵)))
35	30, 31	onsucssi 7861	. . . . . 6 ⊢ ((rank‘⟨𝑥, 𝑦⟩) ∈ (rank‘(𝐴 ∪ 𝐵)) ↔ suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴 ∪ 𝐵)))
36	34, 35	sylib 218	. . . . 5 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴 ∪ 𝐵)))
37	36	ralrimivva 3199	. . . 4 ⊢ (Lim (rank‘(𝐴 ∪ 𝐵)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴 ∪ 𝐵)))
38		fveq2 6906	. . . . . . . 8 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (rank‘𝑧) = (rank‘⟨𝑥, 𝑦⟩))
39		suceq 6451	. . . . . . . 8 ⊢ ((rank‘𝑧) = (rank‘⟨𝑥, 𝑦⟩) → suc (rank‘𝑧) = suc (rank‘⟨𝑥, 𝑦⟩))
40	38, 39	syl 17	. . . . . . 7 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → suc (rank‘𝑧) = suc (rank‘⟨𝑥, 𝑦⟩))
41	40	sseq1d 4026	. . . . . 6 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (suc (rank‘𝑧) ⊆ (rank‘(𝐴 ∪ 𝐵)) ↔ suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴 ∪ 𝐵))))
42	41	ralxp 5854	. . . . 5 ⊢ (∀𝑧 ∈ (𝐴 × 𝐵)suc (rank‘𝑧) ⊆ (rank‘(𝐴 ∪ 𝐵)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴 ∪ 𝐵)))
43	18, 20	xpex 7771	. . . . . 6 ⊢ (𝐴 × 𝐵) ∈ V
44	43	rankbnd 9905	. . . . 5 ⊢ (∀𝑧 ∈ (𝐴 × 𝐵)suc (rank‘𝑧) ⊆ (rank‘(𝐴 ∪ 𝐵)) ↔ (rank‘(𝐴 × 𝐵)) ⊆ (rank‘(𝐴 ∪ 𝐵)))
45	42, 44	bitr3i 277	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 suc (rank‘⟨𝑥, 𝑦⟩) ⊆ (rank‘(𝐴 ∪ 𝐵)) ↔ (rank‘(𝐴 × 𝐵)) ⊆ (rank‘(𝐴 ∪ 𝐵)))
46	37, 45	sylib 218	. . 3 ⊢ (Lim (rank‘(𝐴 ∪ 𝐵)) → (rank‘(𝐴 × 𝐵)) ⊆ (rank‘(𝐴 ∪ 𝐵)))
47	46	adantr 480	. 2 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ (𝐴 × 𝐵) ≠ ∅) → (rank‘(𝐴 × 𝐵)) ⊆ (rank‘(𝐴 ∪ 𝐵)))
48	18, 20	rankxpl 9912	. . 3 ⊢ ((𝐴 × 𝐵) ≠ ∅ → (rank‘(𝐴 ∪ 𝐵)) ⊆ (rank‘(𝐴 × 𝐵)))
49	48	adantl 481	. 2 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ (𝐴 × 𝐵) ≠ ∅) → (rank‘(𝐴 ∪ 𝐵)) ⊆ (rank‘(𝐴 × 𝐵)))
50	47, 49	eqssd 4012	1 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ (𝐴 × 𝐵) ≠ ∅) → (rank‘(𝐴 × 𝐵)) = (rank‘(𝐴 ∪ 𝐵)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1536   ∈ wcel 2105   ≠ wne 2937  ∀wral 3058  Vcvv 3477   ∪ cun 3960   ⊆ wss 3962  ∅c0 4338  𝒫 cpw 4604  {cpr 4632  ⟨cop 4636  ∪ cuni 4911   × cxp 5686  Oncon0 6385  Lim wlim 6386  suc csuc 6387  ‘cfv 6562  rankcrnk 9800

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705  ax-rep 5284  ax-sep 5301  ax-nul 5311  ax-pow 5370  ax-pr 5437  ax-un 7753  ax-reg 9629  ax-inf2 9678

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-nf 1780  df-sb 2062  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2889  df-ne 2938  df-ral 3059  df-rex 3068  df-reu 3378  df-rab 3433  df-v 3479  df-sbc 3791  df-csb 3908  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-pss 3982  df-nul 4339  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-int 4951  df-iun 4997  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5582  df-eprel 5588  df-po 5596  df-so 5597  df-fr 5640  df-we 5642  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-ima 5701  df-pred 6322  df-ord 6388  df-on 6389  df-lim 6390  df-suc 6391  df-iota 6515  df-fun 6564  df-fn 6565  df-f 6566  df-f1 6567  df-fo 6568  df-f1o 6569  df-fv 6570  df-ov 7433  df-om 7887  df-2nd 8013  df-frecs 8304  df-wrecs 8335  df-recs 8409  df-rdg 8448  df-r1 9801  df-rank 9802

This theorem is referenced by:  rankxplim3  9918