rankxplim3 - Metamath Proof Explorer

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

Theorem rankxplim3 9853

Description: The rank of a Cartesian product is a limit ordinal iff its union is. (Contributed by NM, 19-Sep-2006.)

**Hypotheses**
Ref	Expression
rankxplim.1	⊢ 𝐴 ∈ V
rankxplim.2	⊢ 𝐵 ∈ V

**Assertion**
Ref	Expression
rankxplim3	⊢ (Lim (rank‘(𝐴 × 𝐵)) ↔ Lim ∪ (rank‘(𝐴 × 𝐵)))

Proof of Theorem rankxplim3 Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		limuni2 6425	. 2 ⊢ (Lim (rank‘(𝐴 × 𝐵)) → Lim ∪ (rank‘(𝐴 × 𝐵)))
2		0ellim 6426	. . . 4 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → ∅ ∈ ∪ (rank‘(𝐴 × 𝐵)))
3		n0i 4301	. . . 4 ⊢ (∅ ∈ ∪ (rank‘(𝐴 × 𝐵)) → ¬ ∪ (rank‘(𝐴 × 𝐵)) = ∅)
4		unieq 4887	. . . . . 6 ⊢ ((rank‘(𝐴 × 𝐵)) = ∅ → ∪ (rank‘(𝐴 × 𝐵)) = ∪ ∅)
5		uni0 4905	. . . . . 6 ⊢ ∪ ∅ = ∅
6	4, 5	eqtrdi 2820	. . . . 5 ⊢ ((rank‘(𝐴 × 𝐵)) = ∅ → ∪ (rank‘(𝐴 × 𝐵)) = ∅)
7	6	con3i 155	. . . 4 ⊢ (¬ ∪ (rank‘(𝐴 × 𝐵)) = ∅ → ¬ (rank‘(𝐴 × 𝐵)) = ∅)
8	2, 3, 7	3syl 19	. . 3 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → ¬ (rank‘(𝐴 × 𝐵)) = ∅)
9		rankon 9767	. . . . . . . . . 10 ⊢ (rank‘(𝐴 ∪ 𝐵)) ∈ On
10	9	onsuci 7835	. . . . . . . . 9 ⊢ suc (rank‘(𝐴 ∪ 𝐵)) ∈ On
11	10	onsuci 7835	. . . . . . . 8 ⊢ suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ On
12	11	elexi 3485	. . . . . . 7 ⊢ suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ V
13	12	sucid 6446	. . . . . 6 ⊢ suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ suc suc suc (rank‘(𝐴 ∪ 𝐵))
14	11	onsuci 7835	. . . . . . . 8 ⊢ suc suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ On
15		ontri1 6396	. . . . . . . 8 ⊢ ((suc suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ On ∧ suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ On) → (suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ suc suc (rank‘(𝐴 ∪ 𝐵)) ↔ ¬ suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ suc suc suc (rank‘(𝐴 ∪ 𝐵))))
16	14, 11, 15	mp2an 704	. . . . . . 7 ⊢ (suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ suc suc (rank‘(𝐴 ∪ 𝐵)) ↔ ¬ suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ suc suc suc (rank‘(𝐴 ∪ 𝐵)))
17	16	con2bii 360	. . . . . 6 ⊢ (suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ suc suc suc (rank‘(𝐴 ∪ 𝐵)) ↔ ¬ suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ suc suc (rank‘(𝐴 ∪ 𝐵)))
18	13, 17	mpbi 233	. . . . 5 ⊢ ¬ suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ suc suc (rank‘(𝐴 ∪ 𝐵))
19		rankxplim.1	. . . . . . 7 ⊢ 𝐴 ∈ V
20		rankxplim.2	. . . . . . 7 ⊢ 𝐵 ∈ V
21	19, 20	rankxpu 9848	. . . . . 6 ⊢ (rank‘(𝐴 × 𝐵)) ⊆ suc suc (rank‘(𝐴 ∪ 𝐵))
22		sstr 3953	. . . . . 6 ⊢ ((suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ (rank‘(𝐴 × 𝐵)) ∧ (rank‘(𝐴 × 𝐵)) ⊆ suc suc (rank‘(𝐴 ∪ 𝐵))) → suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ suc suc (rank‘(𝐴 ∪ 𝐵)))
23	21, 22	mpan2 703	. . . . 5 ⊢ (suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ (rank‘(𝐴 × 𝐵)) → suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ suc suc (rank‘(𝐴 ∪ 𝐵)))
24	18, 23	mto 200	. . . 4 ⊢ ¬ suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ (rank‘(𝐴 × 𝐵))
25		reeanv 3243	. . . . 5 ⊢ (∃𝑥 ∈ On ∃𝑦 ∈ On ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦) ↔ (∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦))
26		simprl 782	. . . . . . . . . . . . 13 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥)
27		simpr 489	. . . . . . . . . . . . . . . . . 18 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥) → (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥)
28		df-ne 2965	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝐴 × 𝐵) ≠ ∅ ↔ ¬ (𝐴 × 𝐵) = ∅)
29	19, 20	xpex 7752	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝐴 × 𝐵) ∈ V
30	29	rankeq0 9833	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ ((𝐴 × 𝐵) = ∅ ↔ (rank‘(𝐴 × 𝐵)) = ∅)
31	30	notbii 323	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (¬ (𝐴 × 𝐵) = ∅ ↔ ¬ (rank‘(𝐴 × 𝐵)) = ∅)
32	28, 31	bitr2i 279	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (¬ (rank‘(𝐴 × 𝐵)) = ∅ ↔ (𝐴 × 𝐵) ≠ ∅)
33	8, 32	sylib 221	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → (𝐴 × 𝐵) ≠ ∅)
34		unixp 6284	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐴 × 𝐵) ≠ ∅ → ∪ ∪ (𝐴 × 𝐵) = (𝐴 ∪ 𝐵))
35	33, 34	syl 18	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → ∪ ∪ (𝐴 × 𝐵) = (𝐴 ∪ 𝐵))
36	35	fveq2d 6886	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → (rank‘∪ ∪ (𝐴 × 𝐵)) = (rank‘(𝐴 ∪ 𝐵)))
37		rankuni 9835	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (rank‘∪ ∪ (𝐴 × 𝐵)) = ∪ (rank‘∪ (𝐴 × 𝐵))
38		rankuni 9835	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (rank‘∪ (𝐴 × 𝐵)) = ∪ (rank‘(𝐴 × 𝐵))
39	38	unieqi 4888	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ∪ (rank‘∪ (𝐴 × 𝐵)) = ∪ ∪ (rank‘(𝐴 × 𝐵))
40	37, 39	eqtri 2792	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (rank‘∪ ∪ (𝐴 × 𝐵)) = ∪ ∪ (rank‘(𝐴 × 𝐵))
41	36, 40	eqtr3di 2819	. . . . . . . . . . . . . . . . . . . 20 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → (rank‘(𝐴 ∪ 𝐵)) = ∪ ∪ (rank‘(𝐴 × 𝐵)))
42		eqimss 4003	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((rank‘(𝐴 ∪ 𝐵)) = ∪ ∪ (rank‘(𝐴 × 𝐵)) → (rank‘(𝐴 ∪ 𝐵)) ⊆ ∪ ∪ (rank‘(𝐴 × 𝐵)))
43	41, 42	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → (rank‘(𝐴 ∪ 𝐵)) ⊆ ∪ ∪ (rank‘(𝐴 × 𝐵)))
44	43	adantr 485	. . . . . . . . . . . . . . . . . 18 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥) → (rank‘(𝐴 ∪ 𝐵)) ⊆ ∪ ∪ (rank‘(𝐴 × 𝐵)))
45	27, 44	eqsstrrd 3980	. . . . . . . . . . . . . . . . 17 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥) → suc 𝑥 ⊆ ∪ ∪ (rank‘(𝐴 × 𝐵)))
46	45	adantrr 729	. . . . . . . . . . . . . . . 16 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → suc 𝑥 ⊆ ∪ ∪ (rank‘(𝐴 × 𝐵)))
47		limuni 6424	. . . . . . . . . . . . . . . . 17 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → ∪ (rank‘(𝐴 × 𝐵)) = ∪ ∪ (rank‘(𝐴 × 𝐵)))
48	47	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → ∪ (rank‘(𝐴 × 𝐵)) = ∪ ∪ (rank‘(𝐴 × 𝐵)))
49	46, 48	sseqtrrd 3982	. . . . . . . . . . . . . . 15 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → suc 𝑥 ⊆ ∪ (rank‘(𝐴 × 𝐵)))
50		vex 3467	. . . . . . . . . . . . . . . 16 ⊢ 𝑥 ∈ V
51		rankon 9767	. . . . . . . . . . . . . . . . . 18 ⊢ (rank‘(𝐴 × 𝐵)) ∈ On
52	51	onordi 6475	. . . . . . . . . . . . . . . . 17 ⊢ Ord (rank‘(𝐴 × 𝐵))
53		orduni 7788	. . . . . . . . . . . . . . . . 17 ⊢ (Ord (rank‘(𝐴 × 𝐵)) → Ord ∪ (rank‘(𝐴 × 𝐵)))
54	52, 53	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ Ord ∪ (rank‘(𝐴 × 𝐵))
55		ordelsuc 7816	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 ∈ V ∧ Ord ∪ (rank‘(𝐴 × 𝐵))) → (𝑥 ∈ ∪ (rank‘(𝐴 × 𝐵)) ↔ suc 𝑥 ⊆ ∪ (rank‘(𝐴 × 𝐵))))
56	50, 54, 55	mp2an 704	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ∪ (rank‘(𝐴 × 𝐵)) ↔ suc 𝑥 ⊆ ∪ (rank‘(𝐴 × 𝐵)))
57	49, 56	sylibr 237	. . . . . . . . . . . . . 14 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → 𝑥 ∈ ∪ (rank‘(𝐴 × 𝐵)))
58		limsuc 7845	. . . . . . . . . . . . . . 15 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → (𝑥 ∈ ∪ (rank‘(𝐴 × 𝐵)) ↔ suc 𝑥 ∈ ∪ (rank‘(𝐴 × 𝐵))))
59	58	adantr 485	. . . . . . . . . . . . . 14 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → (𝑥 ∈ ∪ (rank‘(𝐴 × 𝐵)) ↔ suc 𝑥 ∈ ∪ (rank‘(𝐴 × 𝐵))))
60	57, 59	mpbid 235	. . . . . . . . . . . . 13 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → suc 𝑥 ∈ ∪ (rank‘(𝐴 × 𝐵)))
61	26, 60	eqeltrd 2869	. . . . . . . . . . . 12 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → (rank‘(𝐴 ∪ 𝐵)) ∈ ∪ (rank‘(𝐴 × 𝐵)))
62		limsuc 7845	. . . . . . . . . . . . 13 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → ((rank‘(𝐴 ∪ 𝐵)) ∈ ∪ (rank‘(𝐴 × 𝐵)) ↔ suc (rank‘(𝐴 ∪ 𝐵)) ∈ ∪ (rank‘(𝐴 × 𝐵))))
63	62	adantr 485	. . . . . . . . . . . 12 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → ((rank‘(𝐴 ∪ 𝐵)) ∈ ∪ (rank‘(𝐴 × 𝐵)) ↔ suc (rank‘(𝐴 ∪ 𝐵)) ∈ ∪ (rank‘(𝐴 × 𝐵))))
64	61, 63	mpbid 235	. . . . . . . . . . 11 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → suc (rank‘(𝐴 ∪ 𝐵)) ∈ ∪ (rank‘(𝐴 × 𝐵)))
65		ordsucelsuc 7818	. . . . . . . . . . . 12 ⊢ (Ord ∪ (rank‘(𝐴 × 𝐵)) → (suc (rank‘(𝐴 ∪ 𝐵)) ∈ ∪ (rank‘(𝐴 × 𝐵)) ↔ suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ suc ∪ (rank‘(𝐴 × 𝐵))))
66	54, 65	ax-mp 5	. . . . . . . . . . 11 ⊢ (suc (rank‘(𝐴 ∪ 𝐵)) ∈ ∪ (rank‘(𝐴 × 𝐵)) ↔ suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ suc ∪ (rank‘(𝐴 × 𝐵)))
67	64, 66	sylib 221	. . . . . . . . . 10 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ suc ∪ (rank‘(𝐴 × 𝐵)))
68		onsucuni2 7830	. . . . . . . . . . . 12 ⊢ (((rank‘(𝐴 × 𝐵)) ∈ On ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦) → suc ∪ (rank‘(𝐴 × 𝐵)) = (rank‘(𝐴 × 𝐵)))
69	51, 68	mpan 702	. . . . . . . . . . 11 ⊢ ((rank‘(𝐴 × 𝐵)) = suc 𝑦 → suc ∪ (rank‘(𝐴 × 𝐵)) = (rank‘(𝐴 × 𝐵)))
70	69	ad2antll 741	. . . . . . . . . 10 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → suc ∪ (rank‘(𝐴 × 𝐵)) = (rank‘(𝐴 × 𝐵)))
71	67, 70	eleqtrd 2871	. . . . . . . . 9 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ (rank‘(𝐴 × 𝐵)))
72	11, 51	onsucssi 7837	. . . . . . . . 9 ⊢ (suc suc (rank‘(𝐴 ∪ 𝐵)) ∈ (rank‘(𝐴 × 𝐵)) ↔ suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ (rank‘(𝐴 × 𝐵)))
73	71, 72	sylib 221	. . . . . . . 8 ⊢ ((Lim ∪ (rank‘(𝐴 × 𝐵)) ∧ ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ (rank‘(𝐴 × 𝐵)))
74	73	ex 417	. . . . . . 7 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → (((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦) → suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ (rank‘(𝐴 × 𝐵))))
75	74	a1d 26	. . . . . 6 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦) → suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ (rank‘(𝐴 × 𝐵)))))
76	75	rexlimdvv 3227	. . . . 5 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → (∃𝑥 ∈ On ∃𝑦 ∈ On ((rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ (rank‘(𝐴 × 𝐵)) = suc 𝑦) → suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ (rank‘(𝐴 × 𝐵))))
77	25, 76	biimtrrid 246	. . . 4 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → ((∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦) → suc suc suc (rank‘(𝐴 ∪ 𝐵)) ⊆ (rank‘(𝐴 × 𝐵))))
78	24, 77	mtoi 202	. . 3 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → ¬ (∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦))
79		ianor 997	. . . . . 6 ⊢ (¬ (∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦) ↔ (¬ ∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∨ ¬ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦))
80		un00 4370	. . . . . . . . . . . . . 14 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) ↔ (𝐴 ∪ 𝐵) = ∅)
81		animorl 993	. . . . . . . . . . . . . 14 ⊢ ((𝐴 = ∅ ∧ 𝐵 = ∅) → (𝐴 = ∅ ∨ 𝐵 = ∅))
82	80, 81	sylbir 238	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∪ 𝐵) = ∅ → (𝐴 = ∅ ∨ 𝐵 = ∅))
83		xpeq0 6158	. . . . . . . . . . . . 13 ⊢ ((𝐴 × 𝐵) = ∅ ↔ (𝐴 = ∅ ∨ 𝐵 = ∅))
84	82, 83	sylibr 237	. . . . . . . . . . . 12 ⊢ ((𝐴 ∪ 𝐵) = ∅ → (𝐴 × 𝐵) = ∅)
85	84	con3i 155	. . . . . . . . . . 11 ⊢ (¬ (𝐴 × 𝐵) = ∅ → ¬ (𝐴 ∪ 𝐵) = ∅)
86	31, 85	sylbir 238	. . . . . . . . . 10 ⊢ (¬ (rank‘(𝐴 × 𝐵)) = ∅ → ¬ (𝐴 ∪ 𝐵) = ∅)
87	19, 20	unex 7743	. . . . . . . . . . . 12 ⊢ (𝐴 ∪ 𝐵) ∈ V
88	87	rankeq0 9833	. . . . . . . . . . 11 ⊢ ((𝐴 ∪ 𝐵) = ∅ ↔ (rank‘(𝐴 ∪ 𝐵)) = ∅)
89	88	notbii 323	. . . . . . . . . 10 ⊢ (¬ (𝐴 ∪ 𝐵) = ∅ ↔ ¬ (rank‘(𝐴 ∪ 𝐵)) = ∅)
90	86, 89	sylib 221	. . . . . . . . 9 ⊢ (¬ (rank‘(𝐴 × 𝐵)) = ∅ → ¬ (rank‘(𝐴 ∪ 𝐵)) = ∅)
91	9	onordi 6475	. . . . . . . . . . 11 ⊢ Ord (rank‘(𝐴 ∪ 𝐵))
92		ordzsl 7841	. . . . . . . . . . 11 ⊢ (Ord (rank‘(𝐴 ∪ 𝐵)) ↔ ((rank‘(𝐴 ∪ 𝐵)) = ∅ ∨ ∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∨ Lim (rank‘(𝐴 ∪ 𝐵))))
93	91, 92	mpbi 233	. . . . . . . . . 10 ⊢ ((rank‘(𝐴 ∪ 𝐵)) = ∅ ∨ ∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∨ Lim (rank‘(𝐴 ∪ 𝐵)))
94	93	3ori 1449	. . . . . . . . 9 ⊢ ((¬ (rank‘(𝐴 ∪ 𝐵)) = ∅ ∧ ¬ ∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥) → Lim (rank‘(𝐴 ∪ 𝐵)))
95	90, 94	sylan 591	. . . . . . . 8 ⊢ ((¬ (rank‘(𝐴 × 𝐵)) = ∅ ∧ ¬ ∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥) → Lim (rank‘(𝐴 ∪ 𝐵)))
96	95	ex 417	. . . . . . 7 ⊢ (¬ (rank‘(𝐴 × 𝐵)) = ∅ → (¬ ∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 → Lim (rank‘(𝐴 ∪ 𝐵))))
97		ordzsl 7841	. . . . . . . . . 10 ⊢ (Ord (rank‘(𝐴 × 𝐵)) ↔ ((rank‘(𝐴 × 𝐵)) = ∅ ∨ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦 ∨ Lim (rank‘(𝐴 × 𝐵))))
98	52, 97	mpbi 233	. . . . . . . . 9 ⊢ ((rank‘(𝐴 × 𝐵)) = ∅ ∨ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦 ∨ Lim (rank‘(𝐴 × 𝐵)))
99	98	3ori 1449	. . . . . . . 8 ⊢ ((¬ (rank‘(𝐴 × 𝐵)) = ∅ ∧ ¬ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦) → Lim (rank‘(𝐴 × 𝐵)))
100	99	ex 417	. . . . . . 7 ⊢ (¬ (rank‘(𝐴 × 𝐵)) = ∅ → (¬ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦 → Lim (rank‘(𝐴 × 𝐵))))
101	96, 100	orim12d 979	. . . . . 6 ⊢ (¬ (rank‘(𝐴 × 𝐵)) = ∅ → ((¬ ∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∨ ¬ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦) → (Lim (rank‘(𝐴 ∪ 𝐵)) ∨ Lim (rank‘(𝐴 × 𝐵)))))
102	79, 101	biimtrid 245	. . . . 5 ⊢ (¬ (rank‘(𝐴 × 𝐵)) = ∅ → (¬ (∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦) → (Lim (rank‘(𝐴 ∪ 𝐵)) ∨ Lim (rank‘(𝐴 × 𝐵)))))
103	102	imp 411	. . . 4 ⊢ ((¬ (rank‘(𝐴 × 𝐵)) = ∅ ∧ ¬ (∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → (Lim (rank‘(𝐴 ∪ 𝐵)) ∨ Lim (rank‘(𝐴 × 𝐵))))
104		simpl 487	. . . . . . . 8 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ ¬ (rank‘(𝐴 × 𝐵)) = ∅) → Lim (rank‘(𝐴 ∪ 𝐵)))
105	30	necon3abii 3010	. . . . . . . . . 10 ⊢ ((𝐴 × 𝐵) ≠ ∅ ↔ ¬ (rank‘(𝐴 × 𝐵)) = ∅)
106	19, 20	rankxplim 9851	. . . . . . . . . 10 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ (𝐴 × 𝐵) ≠ ∅) → (rank‘(𝐴 × 𝐵)) = (rank‘(𝐴 ∪ 𝐵)))
107	105, 106	sylan2br 606	. . . . . . . . 9 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ ¬ (rank‘(𝐴 × 𝐵)) = ∅) → (rank‘(𝐴 × 𝐵)) = (rank‘(𝐴 ∪ 𝐵)))
108		limeq 6373	. . . . . . . . 9 ⊢ ((rank‘(𝐴 × 𝐵)) = (rank‘(𝐴 ∪ 𝐵)) → (Lim (rank‘(𝐴 × 𝐵)) ↔ Lim (rank‘(𝐴 ∪ 𝐵))))
109	107, 108	syl 18	. . . . . . . 8 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ ¬ (rank‘(𝐴 × 𝐵)) = ∅) → (Lim (rank‘(𝐴 × 𝐵)) ↔ Lim (rank‘(𝐴 ∪ 𝐵))))
110	104, 109	mpbird 260	. . . . . . 7 ⊢ ((Lim (rank‘(𝐴 ∪ 𝐵)) ∧ ¬ (rank‘(𝐴 × 𝐵)) = ∅) → Lim (rank‘(𝐴 × 𝐵)))
111	110	expcom 418	. . . . . 6 ⊢ (¬ (rank‘(𝐴 × 𝐵)) = ∅ → (Lim (rank‘(𝐴 ∪ 𝐵)) → Lim (rank‘(𝐴 × 𝐵))))
112		idd 25	. . . . . 6 ⊢ (¬ (rank‘(𝐴 × 𝐵)) = ∅ → (Lim (rank‘(𝐴 × 𝐵)) → Lim (rank‘(𝐴 × 𝐵))))
113	111, 112	jaod 872	. . . . 5 ⊢ (¬ (rank‘(𝐴 × 𝐵)) = ∅ → ((Lim (rank‘(𝐴 ∪ 𝐵)) ∨ Lim (rank‘(𝐴 × 𝐵))) → Lim (rank‘(𝐴 × 𝐵))))
114	113	adantr 485	. . . 4 ⊢ ((¬ (rank‘(𝐴 × 𝐵)) = ∅ ∧ ¬ (∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → ((Lim (rank‘(𝐴 ∪ 𝐵)) ∨ Lim (rank‘(𝐴 × 𝐵))) → Lim (rank‘(𝐴 × 𝐵))))
115	103, 114	mpd 16	. . 3 ⊢ ((¬ (rank‘(𝐴 × 𝐵)) = ∅ ∧ ¬ (∃𝑥 ∈ On (rank‘(𝐴 ∪ 𝐵)) = suc 𝑥 ∧ ∃𝑦 ∈ On (rank‘(𝐴 × 𝐵)) = suc 𝑦)) → Lim (rank‘(𝐴 × 𝐵)))
116	8, 78, 115	syl2anc 595	. 2 ⊢ (Lim ∪ (rank‘(𝐴 × 𝐵)) → Lim (rank‘(𝐴 × 𝐵)))
117	1, 116	impbii 212	1 ⊢ (Lim (rank‘(𝐴 × 𝐵)) ↔ Lim ∪ (rank‘(𝐴 × 𝐵)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 ∨ w3o 1100 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∃wrex 3095 Vcvv 3463 ∪ cun 3911 ⊆ wss 3913 ∅c0 4294 ∪ cuni 4876 × cxp 5660 Ord word 6360 Oncon0 6361 Lim wlim 6362 suc csuc 6363 ‘cfv 6537 rankcrnk 9735

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-reg 9554 ax-inf2 9610

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7414 df-om 7863 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-r1 9736 df-rank 9737

This theorem is referenced by: rankxpsuc 9854

W3C validator