![]() |
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 commutes. 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 1120 | . . 3 ⊢ ((𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶 ∧ (𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴))) ↔ (𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐶 ∧ (𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴)))) | |
2 | orcom 897 | . . . . 5 ⊢ ((𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴)) ↔ (𝐵 ∈ (𝐶𝐼𝐴) ∨ 𝐴 ∈ (𝐶𝐼𝐵))) | |
3 | 2 | a1i 11 | . . . 4 ⊢ (𝜑 → ((𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴)) ↔ (𝐵 ∈ (𝐶𝐼𝐴) ∨ 𝐴 ∈ (𝐶𝐼𝐵)))) |
4 | 3 | 3anbi3d 1567 | . . 3 ⊢ (𝜑 → ((𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐶 ∧ (𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴))) ↔ (𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐶 ∧ (𝐵 ∈ (𝐶𝐼𝐴) ∨ 𝐴 ∈ (𝐶𝐼𝐵))))) |
5 | 1, 4 | syl5bb 275 | . 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 25853 | . 2 ⊢ (𝜑 → (𝐴(𝐾‘𝐶)𝐵 ↔ (𝐴 ≠ 𝐶 ∧ 𝐵 ≠ 𝐶 ∧ (𝐴 ∈ (𝐶𝐼𝐵) ∨ 𝐵 ∈ (𝐶𝐼𝐴))))) |
14 | 6, 7, 8, 10, 9, 11, 12 | ishlg 25853 | . 2 ⊢ (𝜑 → (𝐵(𝐾‘𝐶)𝐴 ↔ (𝐵 ≠ 𝐶 ∧ 𝐴 ≠ 𝐶 ∧ (𝐵 ∈ (𝐶𝐼𝐴) ∨ 𝐴 ∈ (𝐶𝐼𝐵))))) |
15 | 5, 13, 14 | 3bitr4d 303 | 1 ⊢ (𝜑 → (𝐴(𝐾‘𝐶)𝐵 ↔ 𝐵(𝐾‘𝐶)𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 198 ∨ wo 874 ∧ w3a 1108 = wceq 1653 ∈ wcel 2157 ≠ wne 2971 class class class wbr 4843 ‘cfv 6101 (class class class)co 6878 Basecbs 16184 Itvcitv 25687 hlGchlg 25851 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2377 ax-ext 2777 ax-rep 4964 ax-sep 4975 ax-nul 4983 ax-pow 5035 ax-pr 5097 ax-un 7183 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2591 df-eu 2609 df-clab 2786 df-cleq 2792 df-clel 2795 df-nfc 2930 df-ne 2972 df-ral 3094 df-rex 3095 df-reu 3096 df-rab 3098 df-v 3387 df-sbc 3634 df-csb 3729 df-dif 3772 df-un 3774 df-in 3776 df-ss 3783 df-nul 4116 df-if 4278 df-pw 4351 df-sn 4369 df-pr 4371 df-op 4375 df-uni 4629 df-iun 4712 df-br 4844 df-opab 4906 df-mpt 4923 df-id 5220 df-xp 5318 df-rel 5319 df-cnv 5320 df-co 5321 df-dm 5322 df-rn 5323 df-res 5324 df-ima 5325 df-iota 6064 df-fun 6103 df-fn 6104 df-f 6105 df-f1 6106 df-fo 6107 df-f1o 6108 df-fv 6109 df-ov 6881 df-hlg 25852 |
This theorem is referenced by: hlcomd 25855 |
Copyright terms: Public domain | W3C validator |