Theorem tgbtwntriv2 26273

Description: Betweenness always holds for the second endpoint. Theorem 3.1 of [Schwabhauser] p. 30. (Contributed by Thierry Arnoux, 15-Mar-2019.)

Hypotheses

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

Assertion

Ref	Expression
tgbtwntriv2	⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐵))

Proof of Theorem tgbtwntriv2

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simprl 769	. . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → 𝐵 ∈ (𝐴𝐼𝑥))
2		tkgeom.p	. . . . . 6 ⊢ 𝑃 = (Base‘𝐺)
3		tkgeom.d	. . . . . 6 ⊢ − = (dist‘𝐺)
4		tkgeom.i	. . . . . 6 ⊢ 𝐼 = (Itv‘𝐺)
5		tkgeom.g	. . . . . . 7 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
6	5	ad2antrr 724	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝐺 ∈ TarskiG)
7		tgbtwntriv2.2	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
8	7	ad2antrr 724	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝐵 ∈ 𝑃)
9		simplr 767	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝑥 ∈ 𝑃)
10		simpr 487	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → (𝐵 − 𝑥) = (𝐵 − 𝐵))
11	2, 3, 4, 6, 8, 9, 8, 10	axtgcgrid 26249	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝐵 = 𝑥)
12	11	adantrl 714	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → 𝐵 = 𝑥)
13	12	oveq2d 7172	. . 3 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → (𝐴𝐼𝐵) = (𝐴𝐼𝑥))
14	1, 13	eleqtrrd 2916	. 2 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → 𝐵 ∈ (𝐴𝐼𝐵))
15		tgbtwntriv2.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
16	2, 3, 4, 5, 15, 7, 7, 7	axtgsegcon 26250	. 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)))
17	14, 16	r19.29a 3289	1 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼𝐵))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1537   ∈ wcel 2114  ‘cfv 6355  (class class class)co 7156  Basecbs 16483  distcds 16574  TarskiGcstrkg 26216  Itvcitv 26222

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-nul 5210

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-iota 6314  df-fv 6363  df-ov 7159  df-trkgc 26234  df-trkgcb 26236  df-trkg 26239

This theorem is referenced by:  tgbtwncom  26274  tgbtwntriv1  26277  tgcolg  26340  legid  26373  hlid  26395  lnhl  26401  tglinerflx2  26420  mirreu3  26440  mirconn  26464  symquadlem  26475  outpasch  26541  hlpasch  26542