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

Theorem tglngne 28636
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 7365 . . . . . 6 (𝑋𝐿𝑌) = (𝐿‘⟨𝑋, 𝑌⟩)
31, 2eleqtrdi 2847 . . . . 5 (𝜑𝑍 ∈ (𝐿‘⟨𝑋, 𝑌⟩))
4 elfvdm 6870 . . . . 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 28633 . . . . 5 (𝐺 ∈ TarskiG → 𝐿 Fn ((𝑃 × 𝑃) ∖ I ))
11 fndm 6597 . . . . 5 (𝐿 Fn ((𝑃 × 𝑃) ∖ I ) → dom 𝐿 = ((𝑃 × 𝑃) ∖ I ))
126, 10, 113syl 18 . . . 4 (𝜑 → dom 𝐿 = ((𝑃 × 𝑃) ∖ I ))
135, 12eleqtrd 2839 . . 3 (𝜑 → ⟨𝑋, 𝑌⟩ ∈ ((𝑃 × 𝑃) ∖ I ))
1413eldifbd 3903 . 2 (𝜑 → ¬ ⟨𝑋, 𝑌⟩ ∈ I )
15 df-br 5087 . . . 4 (𝑋 I 𝑌 ↔ ⟨𝑋, 𝑌⟩ ∈ I )
16 tglngval.y . . . . 5 (𝜑𝑌𝑃)
17 ideqg 5802 . . . . 5 (𝑌𝑃 → (𝑋 I 𝑌𝑋 = 𝑌))
1816, 17syl 17 . . . 4 (𝜑 → (𝑋 I 𝑌𝑋 = 𝑌))
1915, 18bitr3id 285 . . 3 (𝜑 → (⟨𝑋, 𝑌⟩ ∈ I ↔ 𝑋 = 𝑌))
2019necon3bbid 2970 . 2 (𝜑 → (¬ ⟨𝑋, 𝑌⟩ ∈ I ↔ 𝑋𝑌))
2114, 20mpbid 232 1 (𝜑𝑋𝑌)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206   = wceq 1542  wcel 2114  wne 2933  cdif 3887  cop 4574   class class class wbr 5086   I cid 5520   × cxp 5624  dom cdm 5626   Fn wfn 6489  cfv 6494  (class class class)co 7362  Basecbs 17174  TarskiGcstrkg 28513  Itvcitv 28519  LineGclng 28520
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pr 5372  ax-un 7684
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5521  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-fv 6502  df-ov 7365  df-oprab 7366  df-mpo 7367  df-1st 7937  df-2nd 7938  df-trkg 28539
This theorem is referenced by:  lnhl  28701  tglnne  28714  tglineneq  28730  tglineinteq  28731  ncolncol  28732  coltr  28733  coltr3  28734  perprag  28812
  Copyright terms: Public domain W3C validator