ordssun - Metamath Proof Explorer

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

Theorem ordssun 5827

Description: Property of a subclass of the maximum (i.e. union) of two ordinals. (Contributed by NM, 28-Nov-2003.)

**Assertion**
Ref	Expression
ordssun	⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)))

**Proof of Theorem ordssun**
Step	Hyp	Ref	Expression
1		ordtri2or2 5823	. . 3 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵))
2		ssequn1 3783	. . . . . 6 ⊢ (𝐵 ⊆ 𝐶 ↔ (𝐵 ∪ 𝐶) = 𝐶)
3		sseq2 3627	. . . . . 6 ⊢ ((𝐵 ∪ 𝐶) = 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐶))
4	2, 3	sylbi 207	. . . . 5 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐶))
5		olc 399	. . . . 5 ⊢ (𝐴 ⊆ 𝐶 → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))
6	4, 5	syl6bi 243	. . . 4 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)))
7		ssequn2 3786	. . . . . 6 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐵 ∪ 𝐶) = 𝐵)
8		sseq2 3627	. . . . . 6 ⊢ ((𝐵 ∪ 𝐶) = 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐵))
9	7, 8	sylbi 207	. . . . 5 ⊢ (𝐶 ⊆ 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐵))
10		orc 400	. . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))
11	9, 10	syl6bi 243	. . . 4 ⊢ (𝐶 ⊆ 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)))
12	6, 11	jaoi 394	. . 3 ⊢ ((𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵) → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)))
13	1, 12	syl 17	. 2 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)))
14		ssun 3792	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶) → 𝐴 ⊆ (𝐵 ∪ 𝐶))
15	13, 14	impbid1 215	1 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 196 ∨ wo 383 ∧ wa 384 = wceq 1483 ∪ cun 3572 ⊆ wss 3574 Ord word 5722

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-tr 4753 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-ord 5726

This theorem is referenced by: ordsucun 7025