| 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 1110 | . . . 4 ⊢ ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍) ∨ 𝑋 ∈ (𝑍𝐼𝑌))) | |
| 3 | tglngval.p | . . . . . 6 ⊢ 𝑃 = (Base‘𝐺) | |
| 4 | eqid 2765 | . . . . . 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 28811 | . . . . 5 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ 𝑍 ∈ (𝑌𝐼𝑋))) |
| 11 | 3, 4, 5, 6, 7, 9, 8 | tgbtwncomb 28811 | . . . . 5 ⊢ (𝜑 → (𝑌 ∈ (𝑋𝐼𝑍) ↔ 𝑌 ∈ (𝑍𝐼𝑋))) |
| 12 | 3, 4, 5, 6, 8, 7, 9 | tgbtwncomb 28811 | . . . . 5 ⊢ (𝜑 → (𝑋 ∈ (𝑍𝐼𝑌) ↔ 𝑋 ∈ (𝑌𝐼𝑍))) |
| 13 | 10, 11, 12 | 3orbi123d 1463 | . . . 4 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍) ∨ 𝑋 ∈ (𝑍𝐼𝑌)) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍)))) |
| 14 | 2, 13 | bitrid 286 | . . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍)))) |
| 15 | tglngval.l | . . . 4 ⊢ 𝐿 = (LineG‘𝐺) | |
| 16 | 3, 15, 5, 6, 7, 9, 8 | tgcolg 28876 | . . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)))) |
| 17 | 3, 15, 5, 6, 9, 7, 8 | tgcolg 28876 | . . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍)))) |
| 18 | 14, 16, 17 | 3bitr4d 314 | . 2 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋))) |
| 19 | 1, 18 | mpbid 235 | 1 ⊢ (𝜑 → (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 861 ∨ w3o 1102 = wceq 1570 ∈ wcel 2146 ‘cfv 6540 (class class class)co 7419 Basecbs 17293 distcds 17343 TarskiGcstrkg 28749 Itvcitv 28755 LineGclng 28756 |
| 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-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 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-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 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-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-iota 6496 df-fun 6542 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-trkgc 28770 df-trkgb 28771 df-trkgcb 28772 df-trkg 28775 |
| This theorem is used by: ncolcom 28883 tglineeltr 28957 mirtrcgr 29013 symquadlem 29019 midexlem 29022 symquadprlnglem 29023 colperpexlem1 29064 mideulem2 29068 opphllem 29069 hlpasch 29091 colhp 29105 trgcopy 29168 tgaaddcpbllem1 29205 tgaaddcpbl 29208 cgrg3col4 29227 tgasa1 29232 symquadprlng 29269 |
| Copyright terms: Public domain | W3C validator |