| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hlcomb | Structured version Visualization version GIF version | ||
| Description: The half-line relation is symmetric. Theorem 6.6 of [Schwabhauser] p. 44. (Contributed by Thierry Arnoux, 21-Feb-2020.) |
| Ref | Expression |
|---|---|
| ishlg.p | ⊢ 𝑃 = (Base‘𝐺) |
| ishlg.i | ⊢ 𝐼 = (Itv‘𝐺) |
| ishlg.k | ⊢ 𝐾 = (hlG‘𝐺) |
| ishlg.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| ishlg.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| ishlg.c | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| ishlg.g | ⊢ (𝜑 → 𝐺 ∈ 𝑉) |
| Ref | Expression |
|---|---|
| hlcomb | ⊢ (𝜑 → (𝐴(𝐾‘𝐶)𝐵 ↔ 𝐵(𝐾‘𝐶)𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 3ancoma 1113 | . . 3 ⊢ ((𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶 ∧ (𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴))) ↔ (𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐶 ∧ (𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴)))) | |
| 2 | orcom 883 | . . . . 5 ⊢ ((𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴)) ↔ (𝐵 ∈ (𝐶𝐼𝐴) ∨ 𝐴 ∈ (𝐶𝐼𝐵))) | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (𝜑 → ((𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴)) ↔ (𝐵 ∈ (𝐶𝐼𝐴) ∨ 𝐴 ∈ (𝐶𝐼𝐵)))) |
| 4 | 3 | 3anbi3d 1468 | . . 3 ⊢ (𝜑 → ((𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐶 ∧ (𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴))) ↔ (𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐶 ∧ (𝐵 ∈ (𝐶𝐼𝐴) ∨ 𝐴 ∈ (𝐶𝐼𝐵))))) |
| 5 | 1, 4 | bitrid 286 | . 2 ⊢ (𝜑 → ((𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶 ∧ (𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴))) ↔ (𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐶 ∧ (𝐵 ∈ (𝐶𝐼𝐴) ∨ 𝐴 ∈ (𝐶𝐼𝐵))))) |
| 6 | ishlg.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
| 7 | ishlg.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
| 8 | ishlg.k | . . 3 ⊢ 𝐾 = (hlG‘𝐺) | |
| 9 | ishlg.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 10 | ishlg.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 11 | ishlg.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 12 | ishlg.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝑉) | |
| 13 | 6, 7, 8, 9, 10, 11, 12 | ishlg 28850 | . 2 ⊢ (𝜑 → (𝐴(𝐾‘𝐶)𝐵 ↔ (𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶 ∧ (𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴))))) |
| 14 | 6, 7, 8, 10, 9, 11, 12 | ishlg 28850 | . 2 ⊢ (𝜑 → (𝐵(𝐾‘𝐶)𝐴 ↔ (𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐶 ∧ (𝐵 ∈ (𝐶𝐼𝐴) ∨ 𝐴 ∈ (𝐶𝐼𝐵))))) |
| 15 | 5, 13, 14 | 3bitr4d 314 | 1 ⊢ (𝜑 → (𝐴(𝐾‘𝐶)𝐵 ↔ 𝐵(𝐾‘𝐶)𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∨ wo 860 ∧ w3a 1101 = wceq 1568 ∈ wcel 2141 ≠ wne 2956 class class class wbr 5108 ‘cfv 6536 (class class class)co 7410 Basecbs 17268 Itvcitv 28678 hlGchlg 28845 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-hlg 28846 |
| This theorem is referenced by: hlcomd 28852 |
| Copyright terms: Public domain | W3C validator |