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

Theorem tglnne 29153
Description: It takes two different points to form a line. (Contributed by Thierry Arnoux, 27-Nov-2019.)
Hypotheses
Ref Expression
tglineelsb2.p 𝐵 = (Base‘𝐺)
tglineelsb2.i 𝐼 = (Itv‘𝐺)
tglineelsb2.l 𝐿 = (LineG‘𝐺)
tglineelsb2.g (𝜑 → 𝐺 ∈ TarskiG)
tglnne.x (𝜑 → 𝑋 ∈ 𝐵)
tglnne.y (𝜑 → 𝑌 ∈ 𝐵)
tglnne.1 (𝜑 → (𝑋𝐿𝑌) ∈ ran 𝐿)
Assertion
Ref Expression
tglnne (𝜑 → 𝑋 ≠ 𝑌)

Proof of Theorem tglnne
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tglineelsb2.p . . 3 𝐵 = (Base‘𝐺)
2 tglineelsb2.l . . 3 𝐿 = (LineG‘𝐺)
3 tglineelsb2.i . . 3 𝐼 = (Itv‘𝐺)
4 tglineelsb2.g . . . 4 (𝜑 → 𝐺 ∈ TarskiG)
54ad3antrrr 743 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐺 ∈ TarskiG)
6 tglnne.x . . . 4 (𝜑 → 𝑋 ∈ 𝐵)
76ad3antrrr 743 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑋 ∈ 𝐵)
8 tglnne.y . . . 4 (𝜑 → 𝑌 ∈ 𝐵)
98ad3antrrr 743 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑌 ∈ 𝐵)
10 simpllr 788 . . . . 5 ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ 𝐵)
11 simplr 781 . . . . 5 ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑦 ∈ 𝐵)
12 simprr 785 . . . . 5 ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ≠ 𝑦)
13 eqid 2763 . . . . . 6 (dist‘𝐺) = (dist‘𝐺)
141, 13, 3, 5, 10, 11tgbtwntriv1 29011 . . . . 5 ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐼𝑦))
151, 3, 2, 5, 10, 11, 10, 12, 14btwnlng1 29144 . . . 4 ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦))
16 simprl 783 . . . 4 ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → (𝑋𝐿𝑌) = (𝑥𝐿𝑦))
1715, 16eleqtrrd 2867 . . 3 ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑋𝐿𝑌))
181, 2, 3, 5, 7, 9, 17tglngne 29070 . 2 ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑋 ≠ 𝑌)
19 tglnne.1 . . 3 (𝜑 → (𝑋𝐿𝑌) ∈ ran 𝐿)
201, 3, 2, 4, 19tgisline 29152 . 2 (𝜑 → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦))
2118, 20r19.29vva 3226 1 (𝜑 → 𝑋 ≠ 𝑌)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ran crn 5659  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  distcds 17481  TarskiGcstrkg 28946  Itvcitv 28952  LineGclng 28953
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 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-1st 8035  df-2nd 8036  df-trkgc 28967  df-trkgb 28968  df-trkgcb 28969  df-trkg 28972
This theorem is used by:  footne  29255  footeq  29256  hlperpnel  29258  colperp  29262  mideulem2  29267  opphllem  29268  midex  29270  opphllem3  29282  opphllem6  29285  opphl  29287  lmieu  29346  lnperpex  29366  trgcopy  29368  perpeqlem  29404  perpeq  29405  prlngex  29486  prlngsymquadlem  29498  prlngsymquadopp  29500  quadcgrprlng  29501  tgaltai  29502
  Copyright terms: Public domain W3C validator