| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > colcom | Structured version Visualization version GIF version | ||
| Description: Swapping the points defining a line keeps it unchanged. Part of Theorem 4.11 of [Schwabhauser] p. 34. (Contributed by Thierry Arnoux, 3-Apr-2019.) |
| Ref | Expression |
|---|---|
| tglngval.p | ⊢ 𝑃 = (Base‘𝐺) |
| tglngval.l | ⊢ 𝐿 = (LineG‘𝐺) |
| tglngval.i | ⊢ 𝐼 = (Itv‘𝐺) |
| tglngval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tglngval.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
| tglngval.y | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
| tgcolg.z | ⊢ (𝜑 → 𝑍 ∈ 𝑃) |
| colrot | ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌)) |
| Ref | Expression |
|---|---|
| colcom | ⊢ (𝜑 → (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | colrot | . 2 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌)) | |
| 2 | 3orcomb 1108 | . . . 4 ⊢ ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍) ∨ 𝑋 ∈ (𝑍𝐼𝑌))) | |
| 3 | tglngval.p | . . . . . 6 ⊢ 𝑃 = (Base‘𝐺) | |
| 4 | eqid 2769 | . . . . . 6 ⊢ (dist‘𝐺) = (dist‘𝐺) | |
| 5 | tglngval.i | . . . . . 6 ⊢ 𝐼 = (Itv‘𝐺) | |
| 6 | tglngval.g | . . . . . 6 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 7 | tglngval.x | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 8 | tgcolg.z | . . . . . 6 ⊢ (𝜑 → 𝑍 ∈ 𝑃) | |
| 9 | tglngval.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 10 | 3, 4, 5, 6, 7, 8, 9 | tgbtwncomb 28724 | . . . . 5 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ 𝑍 ∈ (𝑌𝐼𝑋))) |
| 11 | 3, 4, 5, 6, 7, 9, 8 | tgbtwncomb 28724 | . . . . 5 ⊢ (𝜑 → (𝑌 ∈ (𝑋𝐼𝑍) ↔ 𝑌 ∈ (𝑍𝐼𝑋))) |
| 12 | 3, 4, 5, 6, 8, 7, 9 | tgbtwncomb 28724 | . . . . 5 ⊢ (𝜑 → (𝑋 ∈ (𝑍𝐼𝑌) ↔ 𝑋 ∈ (𝑌𝐼𝑍))) |
| 13 | 10, 11, 12 | 3orbi123d 1461 | . . . 4 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍) ∨ 𝑋 ∈ (𝑍𝐼𝑌)) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍)))) |
| 14 | 2, 13 | bitrid 286 | . . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍)))) |
| 15 | tglngval.l | . . . 4 ⊢ 𝐿 = (LineG‘𝐺) | |
| 16 | 3, 15, 5, 6, 7, 9, 8 | tgcolg 28789 | . . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)))) |
| 17 | 3, 15, 5, 6, 9, 7, 8 | tgcolg 28789 | . . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍)))) |
| 18 | 14, 16, 17 | 3bitr4d 314 | . 2 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋))) |
| 19 | 1, 18 | mpbid 235 | 1 ⊢ (𝜑 → (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 860 ∨ w3o 1100 = wceq 1567 ∈ wcel 2149 ‘cfv 6537 (class class class)co 7411 Basecbs 17269 distcds 17319 TarskiGcstrkg 28662 Itvcitv 28668 LineGclng 28669 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-trkgc 28683 df-trkgb 28684 df-trkgcb 28685 df-trkg 28688 |
| This theorem is referenced by: ncolcom 28796 tglineeltr 28866 mirtrcgr 28922 symquadlem 28928 midexlem 28931 colperpexlem1 28970 mideulem2 28974 opphllem 28975 hlpasch 28997 colhp 29011 trgcopy 29072 cgrg3col4 29125 tgasa1 29130 |
| Copyright terms: Public domain | W3C validator |