| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tglngne | Structured version Visualization version GIF version | ||
| Description: It takes two different points to form a line. (Contributed by Thierry Arnoux, 6-Aug-2019.) |
| Ref | Expression |
|---|---|
| tglngval.p | ⊢ 𝑃 = (Base‘𝐺) |
| tglngval.l | ⊢ 𝐿 = (LineG‘𝐺) |
| tglngval.i | ⊢ 𝐼 = (Itv‘𝐺) |
| tglngval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| tglngval.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
| tglngval.y | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
| tglngne.1 | ⊢ (𝜑 → 𝑍 ∈ (𝑋𝐿𝑌)) |
| Ref | Expression |
|---|---|
| tglngne | ⊢ (𝜑 → 𝑋 ≠ 𝑌) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | tglngne.1 | . . . . . 6 ⊢ (𝜑 → 𝑍 ∈ (𝑋𝐿𝑌)) | |
| 2 | df-ov 7443 | . . . . . 6 ⊢ (𝑋𝐿𝑌) = (𝐿‘〈𝑋, 𝑌〉) | |
| 3 | 1, 2 | eleqtrdi 2874 | . . . . 5 ⊢ (𝜑 → 𝑍 ∈ (𝐿‘〈𝑋, 𝑌〉)) |
| 4 | elfvdm 6939 | . . . . 5 ⊢ (𝑍 ∈ (𝐿‘〈𝑋, 𝑌〉) → 〈𝑋, 𝑌〉 ∈ dom 𝐿) | |
| 5 | 3, 4 | syl 18 | . . . 4 ⊢ (𝜑 → 〈𝑋, 𝑌〉 ∈ dom 𝐿) |
| 6 | tglngval.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 7 | tglngval.p | . . . . . 6 ⊢ 𝑃 = (Base‘𝐺) | |
| 8 | tglngval.l | . . . . . 6 ⊢ 𝐿 = (LineG‘𝐺) | |
| 9 | tglngval.i | . . . . . 6 ⊢ 𝐼 = (Itv‘𝐺) | |
| 10 | 7, 8, 9 | tglnfn 29037 | . . . . 5 ⊢ (𝐺 ∈ TarskiG → 𝐿 Fn ((𝑃 × 𝑃) ∖ I )) |
| 11 | fndm 6661 | . . . . 5 ⊢ (𝐿 Fn ((𝑃 × 𝑃) ∖ I ) → dom 𝐿 = ((𝑃 × 𝑃) ∖ I )) | |
| 12 | 6, 10, 11 | 3syl 19 | . . . 4 ⊢ (𝜑 → dom 𝐿 = ((𝑃 × 𝑃) ∖ I )) |
| 13 | 5, 12 | eleqtrd 2866 | . . 3 ⊢ (𝜑 → 〈𝑋, 𝑌〉 ∈ ((𝑃 × 𝑃) ∖ I )) |
| 14 | 13 | eldifbd 4055 | . 2 ⊢ (𝜑 → ¬ 〈𝑋, 𝑌〉 ∈ I ) |
| 15 | df-br 5107 | . . . 4 ⊢ (𝑋 I 𝑌 ↔ 〈𝑋, 𝑌〉 ∈ I ) | |
| 16 | tglngval.y | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 17 | ideqg 5834 | . . . . 5 ⊢ (𝑌 ∈ 𝑃 → (𝑋 I 𝑌 ↔ 𝑋 = 𝑌)) | |
| 18 | 16, 17 | syl 18 | . . . 4 ⊢ (𝜑 → (𝑋 I 𝑌 ↔ 𝑋 = 𝑌)) |
| 19 | 15, 18 | bitr3id 288 | . . 3 ⊢ (𝜑 → (〈𝑋, 𝑌〉 ∈ I ↔ 𝑋 = 𝑌)) |
| 20 | 19 | necon3bbid 2996 | . 2 ⊢ (𝜑 → (¬ 〈𝑋, 𝑌〉 ∈ I ↔ 𝑋 ≠ 𝑌)) |
| 21 | 14, 20 | mpbid 235 | 1 ⊢ (𝜑 → 𝑋 ≠ 𝑌) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∖ cdif 4048 〈cop 4838 class class class wbr 5106 I cid 5549 × cxp 5653 dom cdm 5655 Fn wfn 6550 ‘cfv 6555 (class class class)co 7440 Basecbs 17413 TarskiGcstrkg 28916 Itvcitv 28922 LineGclng 28923 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7772 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-fv 6563 df-ov 7443 df-oprab 7444 df-mpo 7445 df-1st 8022 df-2nd 8023 df-trkg 28942 |
| This theorem is used by: lnhl 29108 tglnne 29123 tglineneq 29140 tglineinteq 29141 ncolncol 29142 coltr 29143 coltr3 29144 symquadprlnglem 29192 perprag 29229 hlopp 29277 angmgmaddrid 29420 symquadprlng 29467 |
| Copyright terms: Public domain | W3C validator |