Theorem tglnne 28956

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.

Step	Hyp	Ref	Expression
1		tglineelsb2.p	. . 3 ⊢ 𝐵 = (Base‘𝐺)
2		tglineelsb2.l	. . 3 ⊢ 𝐿 = (LineG‘𝐺)
3		tglineelsb2.i	. . 3 ⊢ 𝐼 = (Itv‘𝐺)
4		tglineelsb2.g	. . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5	4	ad3antrrr 743	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐺 ∈ TarskiG)
6		tglnne.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
7	6	ad3antrrr 743	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑋 ∈ 𝐵)
8		tglnne.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
9	8	ad3antrrr 743	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑌 ∈ 𝐵)
10		simpllr 788	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ 𝐵)
11		simplr 781	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑦 ∈ 𝐵)
12		simprr 785	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ≠ 𝑦)
13		eqid 2765	. . . . . 6 ⊢ (dist‘𝐺) = (dist‘𝐺)
14	1, 13, 3, 5, 10, 11	tgbtwntriv1 28815	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐼𝑦))
15	1, 3, 2, 5, 10, 11, 10, 12, 14	btwnlng1 28947	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦))
16		simprl 783	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → (𝑋𝐿𝑌) = (𝑥𝐿𝑦))
17	15, 16	eleqtrrd 2868	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑋𝐿𝑌))
18	1, 2, 3, 5, 7, 9, 17	tglngne 28874	. 2 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑋 ≠ 𝑌)
19		tglnne.1	. . 3 ⊢ (𝜑 → (𝑋𝐿𝑌) ∈ ran 𝐿)
20	1, 3, 2, 4, 19	tgisline 28955	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦))
21	18, 20	r19.29vva 3227	1 ⊢ (𝜑 → 𝑋 ≠ 𝑌)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ≠ wne 2960  ran crn 5664  ‘cfv 6540  (class class class)co 7419  Basecbs 17295  distcds 17345  TarskiGcstrkg 28751  Itvcitv 28757  LineGclng 28758

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  ax-un 7742

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-csb 3855  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-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-1st 7992  df-2nd 7993  df-trkgc 28772  df-trkgb 28773  df-trkgcb 28774  df-trkg 28777

This theorem is used by:  footne  29058  footeq  29059  hlperpnel  29061  colperp  29065  mideulem2  29070  opphllem  29071  midex  29073  opphllem3  29085  opphllem6  29088  opphl  29090  lmieu  29148  lnperpex  29168  trgcopy  29170  perpeqlem  29205  perpeq  29206  prlngex  29260  prlngsymquadlem  29272  prlngsymquadopp  29274  quadcgrprlng  29275  tgaltai  29276