Theorem tgbtwnne 28770

Description: Betweenness and inequality. (Contributed by Thierry Arnoux, 1-Dec-2019.)

Hypotheses

Ref	Expression
tkgeom.p	⊢ 𝑃 = (Base‘𝐺)
tkgeom.d	⊢ − = (dist‘𝐺)
tkgeom.i	⊢ 𝐼 = (Itv‘𝐺)
tkgeom.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
tgbtwntriv2.1	⊢ (𝜑 → 𝐴 ∈ 𝑃)
tgbtwntriv2.2	⊢ (𝜑 → 𝐵 ∈ 𝑃)
tgbtwncomb.3	⊢ (𝜑 → 𝐶 ∈ 𝑃)
tgbtwnne.1	⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐶))
tgbtwnne.2	⊢ (𝜑 → 𝐵 ≠ 𝐴)

Assertion

Ref	Expression
tgbtwnne	⊢ (𝜑 → 𝐴 ≠ 𝐶)

Proof of Theorem tgbtwnne

Step	Hyp	Ref	Expression
1		tkgeom.p	. . . . 5 ⊢ 𝑃 = (Base‘𝐺)
2		tkgeom.d	. . . . 5 ⊢ − = (dist‘𝐺)
3		tkgeom.i	. . . . 5 ⊢ 𝐼 = (Itv‘𝐺)
4		tkgeom.g	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5	4	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐺 ∈ TarskiG)
6		tgbtwntriv2.1	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
7	6	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 ∈ 𝑃)
8		tgbtwntriv2.2	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
9	8	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐵 ∈ 𝑃)
10		tgbtwnne.1	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐶))
11	10	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐵 ∈ (𝐴𝐼𝐶))
12		simpr 489	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 = 𝐶)
13	12	oveq2d 7428	. . . . . 6 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → (𝐴𝐼𝐴) = (𝐴𝐼𝐶))
14	11, 13	eleqtrrd 2865	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐵 ∈ (𝐴𝐼𝐴))
15	1, 2, 3, 5, 7, 9, 14	axtgbtwnid 28746	. . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐴 = 𝐵)
16	15	eqcomd 2768	. . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐵 = 𝐴)
17		tgbtwnne.2	. . . . 5 ⊢ (𝜑 → 𝐵 ≠ 𝐴)
18	17	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → 𝐵 ≠ 𝐴)
19	18	neneqd 2962	. . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐶) → ¬ 𝐵 = 𝐴)
20	16, 19	pm2.65da 828	. 2 ⊢ (𝜑 → ¬ 𝐴 = 𝐶)
21	20	neqned 2964	1 ⊢ (𝜑 → 𝐴 ≠ 𝐶)

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142   ≠ wne 2957  ‘cfv 6536  (class class class)co 7412  Basecbs 17275  distcds 17325  TarskiGcstrkg 28707  Itvcitv 28713

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-nul 5268

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-iota 6492  df-fv 6544  df-ov 7415  df-trkgb 28729  df-trkg 28733

This theorem is used by:  mideulem2  29026  opphllem  29027  outpasch  29048  lnopp2hpgb  29056  plngrotlem1  29080  lmieu  29104  dfcgra2  29152