| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ordelinel | Structured version Visualization version GIF version | ||
| Description: The intersection of two ordinal classes is an element of a third if and only if either one of them is. (Contributed by David Moews, 1-May-2017.) (Proof shortened by JJ, 24-Sep-2021.) |
| Ref | Expression |
|---|---|
| ordelinel | ⊢ ((Ord 𝐴 ∧ Ord 𝐵 ∧ Ord 𝐶) → ((𝐴 ∩ 𝐵) ∈ 𝐶 ↔ (𝐴 ∈ 𝐶 ∨ 𝐵 ∈ 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ordtri2or3 6467 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = (𝐴 ∩ 𝐵) ∨ 𝐵 = (𝐴 ∩ 𝐵))) | |
| 2 | 1 | 3adant3 1150 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵 ∧ Ord 𝐶) → (𝐴 = (𝐴 ∩ 𝐵) ∨ 𝐵 = (𝐴 ∩ 𝐵))) |
| 3 | eleq1a 2860 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) ∈ 𝐶 → (𝐴 = (𝐴 ∩ 𝐵) → 𝐴 ∈ 𝐶)) | |
| 4 | eleq1a 2860 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) ∈ 𝐶 → (𝐵 = (𝐴 ∩ 𝐵) → 𝐵 ∈ 𝐶)) | |
| 5 | 3, 4 | orim12d 979 | . . 3 ⊢ ((𝐴 ∩ 𝐵) ∈ 𝐶 → ((𝐴 = (𝐴 ∩ 𝐵) ∨ 𝐵 = (𝐴 ∩ 𝐵)) → (𝐴 ∈ 𝐶 ∨ 𝐵 ∈ 𝐶))) |
| 6 | 2, 5 | syl5com 32 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵 ∧ Ord 𝐶) → ((𝐴 ∩ 𝐵) ∈ 𝐶 → (𝐴 ∈ 𝐶 ∨ 𝐵 ∈ 𝐶))) |
| 7 | ordin 6395 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → Ord (𝐴 ∩ 𝐵)) | |
| 8 | inss1 4189 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 9 | ordtr2 6410 | . . . . 5 ⊢ ((Ord (𝐴 ∩ 𝐵) ∧ Ord 𝐶) → (((𝐴 ∩ 𝐵) ⊆ 𝐴 ∧ 𝐴 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶)) | |
| 10 | 8, 9 | mpani 709 | . . . 4 ⊢ ((Ord (𝐴 ∩ 𝐵) ∧ Ord 𝐶) → (𝐴 ∈ 𝐶 → (𝐴 ∩ 𝐵) ∈ 𝐶)) |
| 11 | inss2 4190 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
| 12 | ordtr2 6410 | . . . . 5 ⊢ ((Ord (𝐴 ∩ 𝐵) ∧ Ord 𝐶) → (((𝐴 ∩ 𝐵) ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶)) | |
| 13 | 11, 12 | mpani 709 | . . . 4 ⊢ ((Ord (𝐴 ∩ 𝐵) ∧ Ord 𝐶) → (𝐵 ∈ 𝐶 → (𝐴 ∩ 𝐵) ∈ 𝐶)) |
| 14 | 10, 13 | jaod 873 | . . 3 ⊢ ((Ord (𝐴 ∩ 𝐵) ∧ Ord 𝐶) → ((𝐴 ∈ 𝐶 ∨ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶)) |
| 15 | 7, 14 | stoic3 1809 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵 ∧ Ord 𝐶) → ((𝐴 ∈ 𝐶 ∨ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶)) |
| 16 | 6, 15 | impbid 215 | 1 ⊢ ((Ord 𝐴 ∧ Ord 𝐵 ∧ Ord 𝐶) → ((𝐴 ∩ 𝐵) ∈ 𝐶 ↔ (𝐴 ∈ 𝐶 ∨ 𝐵 ∈ 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∩ cin 3905 ⊆ wss 3906 Ord word 6363 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-tr 5221 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-ord 6367 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |