|   | 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 6484 | . . . 4 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → (𝐴 = (𝐴 ∩ 𝐵) ∨ 𝐵 = (𝐴 ∩ 𝐵))) | |
| 2 | 1 | 3adant3 1133 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵 ∧ Ord 𝐶) → (𝐴 = (𝐴 ∩ 𝐵) ∨ 𝐵 = (𝐴 ∩ 𝐵))) | 
| 3 | eleq1a 2836 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) ∈ 𝐶 → (𝐴 = (𝐴 ∩ 𝐵) → 𝐴 ∈ 𝐶)) | |
| 4 | eleq1a 2836 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) ∈ 𝐶 → (𝐵 = (𝐴 ∩ 𝐵) → 𝐵 ∈ 𝐶)) | |
| 5 | 3, 4 | orim12d 967 | . . 3 ⊢ ((𝐴 ∩ 𝐵) ∈ 𝐶 → ((𝐴 = (𝐴 ∩ 𝐵) ∨ 𝐵 = (𝐴 ∩ 𝐵)) → (𝐴 ∈ 𝐶 ∨ 𝐵 ∈ 𝐶))) | 
| 6 | 2, 5 | syl5com 31 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵 ∧ Ord 𝐶) → ((𝐴 ∩ 𝐵) ∈ 𝐶 → (𝐴 ∈ 𝐶 ∨ 𝐵 ∈ 𝐶))) | 
| 7 | ordin 6414 | . . 3 ⊢ ((Ord 𝐴 ∧ Ord 𝐵) → Ord (𝐴 ∩ 𝐵)) | |
| 8 | inss1 4237 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 9 | ordtr2 6428 | . . . . 5 ⊢ ((Ord (𝐴 ∩ 𝐵) ∧ Ord 𝐶) → (((𝐴 ∩ 𝐵) ⊆ 𝐴 ∧ 𝐴 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶)) | |
| 10 | 8, 9 | mpani 696 | . . . 4 ⊢ ((Ord (𝐴 ∩ 𝐵) ∧ Ord 𝐶) → (𝐴 ∈ 𝐶 → (𝐴 ∩ 𝐵) ∈ 𝐶)) | 
| 11 | inss2 4238 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
| 12 | ordtr2 6428 | . . . . 5 ⊢ ((Ord (𝐴 ∩ 𝐵) ∧ Ord 𝐶) → (((𝐴 ∩ 𝐵) ⊆ 𝐵 ∧ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶)) | |
| 13 | 11, 12 | mpani 696 | . . . 4 ⊢ ((Ord (𝐴 ∩ 𝐵) ∧ Ord 𝐶) → (𝐵 ∈ 𝐶 → (𝐴 ∩ 𝐵) ∈ 𝐶)) | 
| 14 | 10, 13 | jaod 860 | . . 3 ⊢ ((Ord (𝐴 ∩ 𝐵) ∧ Ord 𝐶) → ((𝐴 ∈ 𝐶 ∨ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶)) | 
| 15 | 7, 14 | stoic3 1776 | . 2 ⊢ ((Ord 𝐴 ∧ Ord 𝐵 ∧ Ord 𝐶) → ((𝐴 ∈ 𝐶 ∨ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶)) | 
| 16 | 6, 15 | impbid 212 | 1 ⊢ ((Ord 𝐴 ∧ Ord 𝐵 ∧ Ord 𝐶) → ((𝐴 ∩ 𝐵) ∈ 𝐶 ↔ (𝐴 ∈ 𝐶 ∨ 𝐵 ∈ 𝐶))) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ∩ cin 3950 ⊆ wss 3951 Ord word 6383 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2708 ax-sep 5296 ax-nul 5306 ax-pr 5432 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3437 df-v 3482 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-br 5144 df-opab 5206 df-tr 5260 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-ord 6387 | 
| This theorem is referenced by: (None) | 
| Copyright terms: Public domain | W3C validator |