Theorem ordsucun 7647

Description: The successor of the maximum (i.e. union) of two ordinals is the maximum of their successors. (Contributed by NM, 28-Nov-2003.)

Assertion

Ref	Expression
ordsucun	⊢ ((Ord 𝐴 ∧ Ord 𝐵) → suc (𝐴 ∪ 𝐵) = (suc 𝐴 ∪ suc 𝐵))

Proof of Theorem ordsucun

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ordun 6352	. . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → Ord (𝐴 ∪ 𝐵))
2		ordsuc 7636	. . . . 5 ⊢ (Ord (𝐴 ∪ 𝐵) ↔ Ord suc (𝐴 ∪ 𝐵))
3		ordelon 6275	. . . . . 6 ⊢ ((Ord suc (𝐴 ∪ 𝐵) ∧ 𝑥 ∈ suc (𝐴 ∪ 𝐵)) → 𝑥 ∈ On)
4	3	ex 412	. . . . 5 ⊢ (Ord suc (𝐴 ∪ 𝐵) → (𝑥 ∈ suc (𝐴 ∪ 𝐵) → 𝑥 ∈ On))
5	2, 4	sylbi 216	. . . 4 ⊢ (Ord (𝐴 ∪ 𝐵) → (𝑥 ∈ suc (𝐴 ∪ 𝐵) → 𝑥 ∈ On))
6	1, 5	syl 17	. . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝑥 ∈ suc (𝐴 ∪ 𝐵) → 𝑥 ∈ On))
7		ordsuc 7636	. . . 4 ⊢ (Ord 𝐴 ↔ Ord suc 𝐴)
8		ordsuc 7636	. . . 4 ⊢ (Ord 𝐵 ↔ Ord suc 𝐵)
9		ordun 6352	. . . . 5 ⊢ ((Ord suc 𝐴 ∧ Ord suc 𝐵) → Ord (suc 𝐴 ∪ suc 𝐵))
10		ordelon 6275	. . . . . 6 ⊢ ((Ord (suc 𝐴 ∪ suc 𝐵) ∧ 𝑥 ∈ (suc 𝐴 ∪ suc 𝐵)) → 𝑥 ∈ On)
11	10	ex 412	. . . . 5 ⊢ (Ord (suc 𝐴 ∪ suc 𝐵) → (𝑥 ∈ (suc 𝐴 ∪ suc 𝐵) → 𝑥 ∈ On))
12	9, 11	syl 17	. . . 4 ⊢ ((Ord suc 𝐴 ∧ Ord suc 𝐵) → (𝑥 ∈ (suc 𝐴 ∪ suc 𝐵) → 𝑥 ∈ On))
13	7, 8, 12	syl2anb 597	. . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝑥 ∈ (suc 𝐴 ∪ suc 𝐵) → 𝑥 ∈ On))
14		ordssun 6350	. . . . . . 7 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝑥 ⊆ (𝐴 ∪ 𝐵) ↔ (𝑥 ⊆ 𝐴 ∨ 𝑥 ⊆ 𝐵)))
15	14	adantl 481	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥 ⊆ (𝐴 ∪ 𝐵) ↔ (𝑥 ⊆ 𝐴 ∨ 𝑥 ⊆ 𝐵)))
16		ordsssuc 6337	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ Ord (𝐴 ∪ 𝐵)) → (𝑥 ⊆ (𝐴 ∪ 𝐵) ↔ 𝑥 ∈ suc (𝐴 ∪ 𝐵)))
17	1, 16	sylan2 592	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥 ⊆ (𝐴 ∪ 𝐵) ↔ 𝑥 ∈ suc (𝐴 ∪ 𝐵)))
18		ordsssuc 6337	. . . . . . . 8 ⊢ ((𝑥 ∈ On ∧ Ord 𝐴) → (𝑥 ⊆ 𝐴 ↔ 𝑥 ∈ suc 𝐴))
19	18	adantrr 713	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥 ⊆ 𝐴 ↔ 𝑥 ∈ suc 𝐴))
20		ordsssuc 6337	. . . . . . . 8 ⊢ ((𝑥 ∈ On ∧ Ord 𝐵) → (𝑥 ⊆ 𝐵 ↔ 𝑥 ∈ suc 𝐵))
21	20	adantrl 712	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥 ⊆ 𝐵 ↔ 𝑥 ∈ suc 𝐵))
22	19, 21	orbi12d 915	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → ((𝑥 ⊆ 𝐴 ∨ 𝑥 ⊆ 𝐵) ↔ (𝑥 ∈ suc 𝐴 ∨ 𝑥 ∈ suc 𝐵)))
23	15, 17, 22	3bitr3d 308	. . . . 5 ⊢ ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥 ∈ suc (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ suc 𝐴 ∨ 𝑥 ∈ suc 𝐵)))
24		elun 4079	. . . . 5 ⊢ (𝑥 ∈ (suc 𝐴 ∪ suc 𝐵) ↔ (𝑥 ∈ suc 𝐴 ∨ 𝑥 ∈ suc 𝐵))
25	23, 24	bitr4di 288	. . . 4 ⊢ ((𝑥 ∈ On ∧ (Ord 𝐴 ∧ Ord 𝐵)) → (𝑥 ∈ suc (𝐴 ∪ 𝐵) ↔ 𝑥 ∈ (suc 𝐴 ∪ suc 𝐵)))
26	25	expcom 413	. . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝑥 ∈ On → (𝑥 ∈ suc (𝐴 ∪ 𝐵) ↔ 𝑥 ∈ (suc 𝐴 ∪ suc 𝐵))))
27	6, 13, 26	pm5.21ndd 380	. 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝑥 ∈ suc (𝐴 ∪ 𝐵) ↔ 𝑥 ∈ (suc 𝐴 ∪ suc 𝐵)))
28	27	eqrdv 2736	1 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → suc (𝐴 ∪ 𝐵) = (suc 𝐴 ∪ suc 𝐵))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∨ wo 843   = wceq 1539   ∈ wcel 2108   ∪ cun 3881   ⊆ wss 3883  Ord word 6250  Oncon0 6251  suc csuc 6253

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-11 2156  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-tr 5188  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-ord 6254  df-on 6255  df-suc 6257

This theorem is referenced by:  rankprb  9540