Theorem tglnne 29111

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 2763	. . . . . 6 ⊢ (dist‘𝐺) = (dist‘𝐺)
14	1, 13, 3, 5, 10, 11	tgbtwntriv1 28969	. . . . 5 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐼𝑦))
15	1, 3, 2, 5, 10, 11, 10, 12, 14	btwnlng1 29102	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑥𝐿𝑦))
16		simprl 783	. . . 4 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → (𝑋𝐿𝑌) = (𝑥𝐿𝑦))
17	15, 16	eleqtrrd 2867	. . 3 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑥 ∈ (𝑋𝐿𝑌))
18	1, 2, 3, 5, 7, 9, 17	tglngne 29028	. 2 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝑋 ≠ 𝑌)
19		tglnne.1	. . 3 ⊢ (𝜑 → (𝑋𝐿𝑌) ∈ ran 𝐿)
20	1, 3, 2, 4, 19	tgisline 29110	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐵 ((𝑋𝐿𝑌) = (𝑥𝐿𝑦) ∧ 𝑥 ≠ 𝑦))
21	18, 20	r19.29vva 3226	1 ⊢ (𝜑 → 𝑋 ≠ 𝑌)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2146   ≠ wne 2959  ran crn 5656  ‘cfv 6547  (class class class)co 7430  Basecbs 17402  distcds 17452  TarskiGcstrkg 28904  Itvcitv 28910  LineGclng 28911

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7761

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  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 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-fv 6555  df-ov 7433  df-oprab 7434  df-mpo 7435  df-1st 8011  df-2nd 8012  df-trkgc 28925  df-trkgb 28926  df-trkgcb 28927  df-trkg 28930

This theorem is used by:  footne  29213  footeq  29214  hlperpnel  29216  colperp  29220  mideulem2  29225  opphllem  29226  midex  29228  opphllem3  29240  opphllem6  29243  opphl  29245  lmieu  29304  lnperpex  29324  trgcopy  29326  perpeqlem  29362  perpeq  29363  prlngex  29444  prlngsymquadlem  29456  prlngsymquadopp  29458  quadcgrprlng  29459  tgaltai  29460