MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tglngne Structured version   Visualization version   GIF version

Theorem tglngne 28721
Description: It takes two different points to form a line. (Contributed by Thierry Arnoux, 6-Aug-2019.)
Hypotheses
Ref Expression
tglngval.p 𝑃 = (Base‘𝐺)
tglngval.l 𝐿 = (LineG‘𝐺)
tglngval.i 𝐼 = (Itv‘𝐺)
tglngval.g (𝜑𝐺 ∈ TarskiG)
tglngval.x (𝜑𝑋𝑃)
tglngval.y (𝜑𝑌𝑃)
tglngne.1 (𝜑𝑍 ∈ (𝑋𝐿𝑌))
Assertion
Ref Expression
tglngne (𝜑𝑋𝑌)

Proof of Theorem tglngne
StepHypRef Expression
1 tglngne.1 . . . . . 6 (𝜑𝑍 ∈ (𝑋𝐿𝑌))
2 df-ov 7401 . . . . . 6 (𝑋𝐿𝑌) = (𝐿‘⟨𝑋, 𝑌⟩)
31, 2eleqtrdi 2874 . . . . 5 (𝜑𝑍 ∈ (𝐿‘⟨𝑋, 𝑌⟩))
4 elfvdm 6903 . . . . 5 (𝑍 ∈ (𝐿‘⟨𝑋, 𝑌⟩) → ⟨𝑋, 𝑌⟩ ∈ dom 𝐿)
53, 4syl 17 . . . 4 (𝜑 → ⟨𝑋, 𝑌⟩ ∈ dom 𝐿)
6 tglngval.g . . . . 5 (𝜑𝐺 ∈ TarskiG)
7 tglngval.p . . . . . 6 𝑃 = (Base‘𝐺)
8 tglngval.l . . . . . 6 𝐿 = (LineG‘𝐺)
9 tglngval.i . . . . . 6 𝐼 = (Itv‘𝐺)
107, 8, 9tglnfn 28718 . . . . 5 (𝐺 ∈ TarskiG → 𝐿 Fn ((𝑃 × 𝑃) ∖ I ))
11 fndm 6626 . . . . 5 (𝐿 Fn ((𝑃 × 𝑃) ∖ I ) → dom 𝐿 = ((𝑃 × 𝑃) ∖ I ))
126, 10, 113syl 18 . . . 4 (𝜑 → dom 𝐿 = ((𝑃 × 𝑃) ∖ I ))
135, 12eleqtrd 2866 . . 3 (𝜑 → ⟨𝑋, 𝑌⟩ ∈ ((𝑃 × 𝑃) ∖ I ))
1413eldifbd 3919 . 2 (𝜑 → ¬ ⟨𝑋, 𝑌⟩ ∈ I )
15 df-br 5103 . . . 4 (𝑋 I 𝑌 ↔ ⟨𝑋, 𝑌⟩ ∈ I )
16 tglngval.y . . . . 5 (𝜑𝑌𝑃)
17 ideqg 5825 . . . . 5 (𝑌𝑃 → (𝑋 I 𝑌𝑋 = 𝑌))
1816, 17syl 17 . . . 4 (𝜑 → (𝑋 I 𝑌𝑋 = 𝑌))
1915, 18bitr3id 287 . . 3 (𝜑 → (⟨𝑋, 𝑌⟩ ∈ I ↔ 𝑋 = 𝑌))
2019necon3bbid 2996 . 2 (𝜑 → (¬ ⟨𝑋, 𝑌⟩ ∈ I ↔ 𝑋𝑌))
2114, 20mpbid 234 1 (𝜑𝑋𝑌)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208   = wceq 1562  wcel 2144  wne 2959  cdif 3903  cop 4590   class class class wbr 5102   I cid 5543   × cxp 5647  dom cdm 5649   Fn wfn 6518  cfv 6523  (class class class)co 7398  Basecbs 17247  TarskiGcstrkg 28598  Itvcitv 28604  LineGclng 28605
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pr 5392  ax-un 7720
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-fv 6531  df-ov 7401  df-oprab 7402  df-mpo 7403  df-1st 7972  df-2nd 7973  df-trkg 28624
This theorem is referenced by:  lnhl  28786  tglnne  28799  tglineneq  28816  tglineinteq  28817  ncolncol  28818  coltr  28819  coltr3  28820  perprag  28901
  Copyright terms: Public domain W3C validator