Theorem tglnne 28978

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ran crn 5656  ‘cfv 6533  (class class class)co 7414  Basecbs 17304  distcds 17354  TarskiGcstrkg 28771  Itvcitv 28777  LineGclng 28778

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  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 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988  df-trkgc 28792  df-trkgb 28793  df-trkgcb 28794  df-trkg 28797

This theorem is used by:  footne  29080  footeq  29081  hlperpnel  29083  colperp  29087  mideulem2  29092  opphllem  29093  midex  29095  opphllem3  29107  opphllem6  29110  opphl  29112  lmieu  29171  lnperpex  29191  trgcopy  29193  perpeqlem  29229  perpeq  29230  prlngex  29311  prlngsymquadlem  29323  prlngsymquadopp  29325  quadcgrprlng  29326  tgaltai  29327