![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ordssun | Structured version Visualization version GIF version |
Description: Property of a subclass of the maximum (i.e. union) of two ordinals. (Contributed by NM, 28-Nov-2003.) |
Ref | Expression |
---|---|
ordssun | ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ordtri2or2 6255 | . . 3 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵)) | |
2 | ssequn1 4107 | . . . . . 6 ⊢ (𝐵 ⊆ 𝐶 ↔ (𝐵 ∪ 𝐶) = 𝐶) | |
3 | sseq2 3941 | . . . . . 6 ⊢ ((𝐵 ∪ 𝐶) = 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐶)) | |
4 | 2, 3 | sylbi 220 | . . . . 5 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐶)) |
5 | olc 865 | . . . . 5 ⊢ (𝐴 ⊆ 𝐶 → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)) | |
6 | 4, 5 | syl6bi 256 | . . . 4 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
7 | ssequn2 4110 | . . . . . 6 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐵 ∪ 𝐶) = 𝐵) | |
8 | sseq2 3941 | . . . . . 6 ⊢ ((𝐵 ∪ 𝐶) = 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐵)) | |
9 | 7, 8 | sylbi 220 | . . . . 5 ⊢ (𝐶 ⊆ 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐵)) |
10 | orc 864 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)) | |
11 | 9, 10 | syl6bi 256 | . . . 4 ⊢ (𝐶 ⊆ 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
12 | 6, 11 | jaoi 854 | . . 3 ⊢ ((𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵) → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
13 | 1, 12 | syl 17 | . 2 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
14 | ssun 4116 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶) → 𝐴 ⊆ (𝐵 ∪ 𝐶)) | |
15 | 13, 14 | impbid1 228 | 1 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∨ wo 844 = wceq 1538 ∪ cun 3879 ⊆ wss 3881 Ord word 6158 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-tr 5137 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-ord 6162 |
This theorem is referenced by: ordsucun 7520 |
Copyright terms: Public domain | W3C validator |