Theorem tglnne 28910

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 742	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐺 ∈ TarskiG)
6		tglnne.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
7	6	ad3antrrr 742	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑋 ∈ 𝐵)
8		tglnne.y	. . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
9	8	ad3antrrr 742	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑌 ∈ 𝐵)
10		simpllr 787	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ 𝐵)
11		simplr 780	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑦 ∈ 𝐵)
12		simprr 784	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ≠ 𝑦)
13		eqid 2763	. . . . . 6 ⊢ (dist‘𝐺) = (dist‘𝐺)
14	1, 13, 3, 5, 10, 11	tgbtwntriv1 28769	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐼𝑦))
15	1, 3, 2, 5, 10, 11, 10, 12, 14	btwnlng1 28901	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦))
16		simprl 782	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → (𝑋𝐿𝑌) = (𝑥𝐿𝑦))
17	15, 16	eleqtrrd 2866	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑋𝐿𝑌))
18	1, 2, 3, 5, 7, 9, 17	tglngne 28828	. 2 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑋 ≠ 𝑌)
19		tglnne.1	. . 3 ⊢ (𝜑 → (𝑋𝐿𝑌) ∈ ran 𝐿)
20	1, 3, 2, 4, 19	tgisline 28909	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦))
21	18, 20	r19.29vva 3225	1 ⊢ (𝜑 → 𝑋 ≠ 𝑌)

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1570   ∈ wcel 2143   ≠ wne 2958  ran crn 5662  ‘cfv 6536  (class class class)co 7410  Basecbs 17273  distcds 17323  TarskiGcstrkg 28705  Itvcitv 28711  LineGclng 28712

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-trkgc 28726  df-trkgb 28727  df-trkgcb 28728  df-trkg 28731

This theorem is used by:  footne  29012  footeq  29013  hlperpnel  29015  colperp  29019  mideulem2  29024  opphllem  29025  midex  29027  opphllem3  29039  opphllem6  29042  opphl  29044  lmieu  29102  lnperpex  29122  trgcopy  29124  perpeqlem  29159  perpeq  29160  prlngex  29210  prlngsymquadlem  29222  prlngsymquadopp  29224  quadcgrprlng  29225  tgaltai  29226