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 6362 | . . 3 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵)) | |
2 | ssequn1 4114 | . . . . . 6 ⊢ (𝐵 ⊆ 𝐶 ↔ (𝐵 ∪ 𝐶) = 𝐶) | |
3 | sseq2 3947 | . . . . . 6 ⊢ ((𝐵 ∪ 𝐶) = 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐶)) | |
4 | 2, 3 | sylbi 216 | . . . . 5 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐶)) |
5 | olc 865 | . . . . 5 ⊢ (𝐴 ⊆ 𝐶 → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)) | |
6 | 4, 5 | syl6bi 252 | . . . 4 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
7 | ssequn2 4117 | . . . . . 6 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐵 ∪ 𝐶) = 𝐵) | |
8 | sseq2 3947 | . . . . . 6 ⊢ ((𝐵 ∪ 𝐶) = 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐵)) | |
9 | 7, 8 | sylbi 216 | . . . . 5 ⊢ (𝐶 ⊆ 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ 𝐴 ⊆ 𝐵)) |
10 | orc 864 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶)) | |
11 | 9, 10 | syl6bi 252 | . . . 4 ⊢ (𝐶 ⊆ 𝐵 → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
12 | 6, 11 | jaoi 854 | . . 3 ⊢ ((𝐵 ⊆ 𝐶 ∨ 𝐶 ⊆ 𝐵) → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
13 | 1, 12 | syl 17 | . 2 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐴 ⊆ (𝐵 ∪ 𝐶) → (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
14 | ssun 4123 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶) → 𝐴 ⊆ (𝐵 ∪ 𝐶)) | |
15 | 13, 14 | impbid1 224 | 1 ⊢ ((Ord 𝐵 ∧ Ord 𝐶) → (𝐴 ⊆ (𝐵 ∪ 𝐶) ↔ (𝐴 ⊆ 𝐵 ∨ 𝐴 ⊆ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 844 = wceq 1539 ∪ cun 3885 ⊆ wss 3887 Ord word 6265 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-11 2154 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-tr 5192 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-ord 6269 |
This theorem is referenced by: ordsucun 7672 |
Copyright terms: Public domain | W3C validator |