| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ncolcom | Structured version Visualization version GIF version | ||
| Description: Swapping non-colinear points. (Contributed by Thierry Arnoux, 19-Oct-2019.) |
| Ref | Expression |
|---|---|
| tglngval.p | ⊢ 𝑃 = (Base‘𝐺) |
| tglngval.l | ⊢ 𝐿 = (LineG‘𝐺) |
| tglngval.i | ⊢ 𝐼 = (Itv‘𝐺) |
| tglngval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tglngval.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
| tglngval.y | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
| tgcolg.z | ⊢ (𝜑 → 𝑍 ∈ 𝑃) |
| ncolrot | ⊢ (𝜑 → ¬ (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌)) |
| Ref | Expression |
|---|---|
| ncolcom | ⊢ (𝜑 → ¬ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ncolrot | . 2 ⊢ (𝜑 → ¬ (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌)) | |
| 2 | tglngval.p | . . 3 ⊢ 𝑃 = (Base‘𝐺) | |
| 3 | tglngval.l | . . 3 ⊢ 𝐿 = (LineG‘𝐺) | |
| 4 | tglngval.i | . . 3 ⊢ 𝐼 = (Itv‘𝐺) | |
| 5 | tglngval.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 6 | 5 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) → 𝐺 ∈ TarskiG) |
| 7 | tglngval.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 8 | 7 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) → 𝑌 ∈ 𝑃) |
| 9 | tglngval.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 10 | 9 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) → 𝑋 ∈ 𝑃) |
| 11 | tgcolg.z | . . . 4 ⊢ (𝜑 → 𝑍 ∈ 𝑃) | |
| 12 | 11 | adantr 486 | . . 3 ⊢ ((𝜑 ∧ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) → 𝑍 ∈ 𝑃) |
| 13 | simpr 490 | . . 3 ⊢ ((𝜑 ∧ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) → (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) | |
| 14 | 2, 3, 4, 6, 8, 10, 12, 13 | colcom 28880 | . 2 ⊢ ((𝜑 ∧ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) → (𝑍 ∈ (𝑋𝐿𝑌) ∨ 𝑋 = 𝑌)) |
| 15 | 1, 14 | mtand 828 | 1 ⊢ (𝜑 → ¬ (𝑍 ∈ (𝑌𝐿𝑋) ∨ 𝑌 = 𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2146 ‘cfv 6540 (class class class)co 7419 Basecbs 17293 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: ncolne2 28952 symquadlem 29019 midexlem 29022 outpasch 29090 symquadmid 29161 acopyeu 29198 cgrg3col4 29227 tgasa1 29232 prlngsymquadlem 29270 prlngsymquadopp 29272 quadcgrprlng 29273 tgaltai 29274 |
| Copyright terms: Public domain | W3C validator |