MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tgbtwntriv2 Structured version   Visualization version   GIF version

Theorem tgbtwntriv2 28950
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.
StepHypRef Expression
1 simprl 783 . . 3 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → 𝐵 ∈ (𝐴𝐼𝑥))
2 tkgeom.p . . . . . 6 𝑃 = (Base‘𝐺)
3 tkgeom.d . . . . . 6 − = (dist‘𝐺)
4 tkgeom.i . . . . . 6 𝐼 = (Itv‘𝐺)
5 tkgeom.g . . . . . . 7 (𝜑 → 𝐺 ∈ TarskiG)
65ad2antrr 739 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝐺 ∈ TarskiG)
7 tgbtwntriv2.2 . . . . . . 7 (𝜑 → 𝐵 ∈ 𝑃)
87ad2antrr 739 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝐵 ∈ 𝑃)
9 simplr 781 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝑥 ∈ 𝑃)
10 simpr 490 . . . . . 6 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → (𝐵 − 𝑥) = (𝐵 − 𝐵))
112, 3, 4, 6, 8, 9, 8, 10axtgcgrid 28925 . . . . 5 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)) → 𝐵 = 𝑥)
1211adantrl 729 . . . 4 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → 𝐵 = 𝑥)
1312oveq2d 7436 . . 3 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → (𝐴𝐼𝐵) = (𝐴𝐼𝑥))
141, 13eleqtrrd 2864 . 2 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵))) → 𝐵 ∈ (𝐴𝐼𝐵))
15 tgbtwntriv2.1 . . 3 (𝜑 → 𝐴 ∈ 𝑃)
162, 3, 4, 5, 15, 7, 7, 7axtgsegcon 28926 . 2 (𝜑 → ∃𝑥 ∈ 𝑃 (𝐵 ∈ (𝐴𝐼𝑥) ∧ (𝐵 − 𝑥) = (𝐵 − 𝐵)))
1714, 16r19.29a 3171 1 (𝜑 → 𝐵 ∈ (𝐴𝐼𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  distcds 17437  TarskiGcstrkg 28889  Itvcitv 28895
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-ext 2733  ax-nul 5260
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-iota 6494  df-fv 6546  df-ov 7423  df-trkgc 28910  df-trkgcb 28912  df-trkg 28915
This theorem is used by:  tgbtwncom  28951  tgbtwntriv1  28954  tgcolg  29017  legid  29050  hlid  29075  lnhl  29081  tglinerflx2  29102  mirreu3  29126  mirconn  29150  symquadlem  29161  outpasch  29233  hlpasch  29234  plngrotlem1  29265  angmgmaddcpbl  29390
  Copyright terms: Public domain W3C validator