| 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 1093 | . . . 4 ⊢ ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍) ∨ 𝑋 ∈ (𝑍𝐼𝑌))) | |
| 3 | tglngval.p | . . . . . 6 ⊢ 𝑃 = (Base‘𝐺) | |
| 4 | eqid 2729 | . . . . . 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 28416 | . . . . 5 ⊢ (𝜑 → (𝑍 ∈ (𝑋𝐼𝑌) ↔ 𝑍 ∈ (𝑌𝐼𝑋))) |
| 11 | 3, 4, 5, 6, 7, 9, 8 | tgbtwncomb 28416 | . . . . 5 ⊢ (𝜑 → (𝑌 ∈ (𝑋𝐼𝑍) ↔ 𝑌 ∈ (𝑍𝐼𝑋))) |
| 12 | 3, 4, 5, 6, 8, 7, 9 | tgbtwncomb 28416 | . . . . 5 ⊢ (𝜑 → (𝑋 ∈ (𝑍𝐼𝑌) ↔ 𝑋 ∈ (𝑌𝐼𝑍))) |
| 13 | 10, 11, 12 | 3orbi123d 1437 | . . . 4 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍) ∨ 𝑋 ∈ (𝑍𝐼𝑌)) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍)))) |
| 14 | 2, 13 | bitrid 283 | . . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍)))) |
| 15 | tglngval.l | . . . 4 ⊢ 𝐿 = (LineG‘𝐺) | |
| 16 | 3, 15, 5, 6, 7, 9, 8 | tgcolg 28481 | . . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑋𝐼𝑌) ∨ 𝑋 ∈ (𝑍𝐼𝑌) ∨ 𝑌 ∈ (𝑋𝐼𝑍)))) |
| 17 | 3, 15, 5, 6, 9, 7, 8 | tgcolg 28481 | . . 3 ⊢ (𝜑 → ((𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋) ↔ (𝑍 ∈ (𝑌𝐼𝑋) ∨ 𝑌 ∈ (𝑍𝐼𝑋) ∨ 𝑋 ∈ (𝑌𝐼𝑍)))) |
| 18 | 14, 16, 17 | 3bitr4d 311 | . 2 ⊢ (𝜑 → ((𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌) ↔ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋))) |
| 19 | 1, 18 | mpbid 232 | 1 ⊢ (𝜑 → (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 847 ∨ w3o 1085 = wceq 1540 ∈ wcel 2109 ‘cfv 6511 (class class class)co 7387 Basecbs 17179 distcds 17229 TarskiGcstrkg 28354 Itvcitv 28360 LineGclng 28361 |
| 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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-iota 6464 df-fun 6513 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-trkgc 28375 df-trkgb 28376 df-trkgcb 28377 df-trkg 28380 |
| This theorem is referenced by: ncolcom 28488 tglineeltr 28558 mirtrcgr 28610 symquadlem 28616 midexlem 28619 colperpexlem1 28657 mideulem2 28661 opphllem 28662 hlpasch 28683 colhp 28697 trgcopy 28731 cgrg3col4 28780 tgasa1 28785 |
| Copyright terms: Public domain | W3C validator |