| 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 6464 | . . 3 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵)) | |
| 2 | ssequn1 4184 | . . . . . 6 ⊢ (𝐵 ⊆ 𝐶 ↔ (𝐵 ∪ 𝐶) = 𝐶) | |
| 3 | sseq2 3934 | . . . . . 6 ⊢ ((𝐵 ∪ 𝐶) = 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐶)) | |
| 4 | 2, 3 | sylbi 220 | . . . . 5 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐶)) |
| 5 | olc 882 | . . . . 5 ⊢ (𝐴 ⊆ 𝐶 → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)) | |
| 6 | 4, 5 | biimtrdi 256 | . . . 4 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
| 7 | ssequn2 4187 | . . . . . 6 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐵 ∪ 𝐶) = 𝐵) | |
| 8 | sseq2 3934 | . . . . . 6 ⊢ ((𝐵 ∪ 𝐶) = 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐵)) | |
| 9 | 7, 8 | sylbi 220 | . . . . 5 ⊢ (𝐶 ⊆ 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐵)) |
| 10 | orc 881 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)) | |
| 11 | 9, 10 | biimtrdi 256 | . . . 4 ⊢ (𝐶 ⊆ 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
| 12 | 6, 11 | jaoi 871 | . . 3 ⊢ ((𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵) → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
| 13 | 1, 12 | syl 18 | . 2 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
| 14 | ssun 4193 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶) → 𝐴 ⊆ (𝐵 ∪ 𝐶)) | |
| 15 | 13, 14 | impbid1 228 | 1 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1569 ⊆ wss 3895 ∪ cun 4149 Ord word 6361 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-br 5103 df-opab 5167 df-tr 5212 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-ord 6365 |
| This theorem is used by: ordsucun 7837 |
| Copyright terms: Public domain | W3C validator |