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

Theorem tgbtwnswapid 26289
Description: If you can swap the first two arguments of a betweenness statement, then those arguments are identical. Theorem 3.4 of [Schwabhauser] p. 30. (Contributed by Thierry Arnoux, 16-Mar-2019.)
Hypotheses
Ref Expression
tkgeom.p 𝑃 = (Base‘𝐺)
tkgeom.d = (dist‘𝐺)
tkgeom.i 𝐼 = (Itv‘𝐺)
tkgeom.g (𝜑𝐺 ∈ TarskiG)
tgbtwnswapid.1 (𝜑𝐴𝑃)
tgbtwnswapid.2 (𝜑𝐵𝑃)
tgbtwnswapid.3 (𝜑𝐶𝑃)
tgbtwnswapid.4 (𝜑𝐴 ∈ (𝐵𝐼𝐶))
tgbtwnswapid.5 (𝜑𝐵 ∈ (𝐴𝐼𝐶))
Assertion
Ref Expression
tgbtwnswapid (𝜑𝐴 = 𝐵)

Proof of Theorem tgbtwnswapid
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 tkgeom.p . . . 4 𝑃 = (Base‘𝐺)
2 tkgeom.d . . . 4 = (dist‘𝐺)
3 tkgeom.i . . . 4 𝐼 = (Itv‘𝐺)
4 tkgeom.g . . . . 5 (𝜑𝐺 ∈ TarskiG)
54ad2antrr 725 . . . 4 (((𝜑𝑥𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐺 ∈ TarskiG)
6 tgbtwnswapid.1 . . . . 5 (𝜑𝐴𝑃)
76ad2antrr 725 . . . 4 (((𝜑𝑥𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐴𝑃)
8 simplr 768 . . . 4 (((𝜑𝑥𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝑥𝑃)
9 simprl 770 . . . 4 (((𝜑𝑥𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝑥 ∈ (𝐴𝐼𝐴))
101, 2, 3, 5, 7, 8, 9axtgbtwnid 26263 . . 3 (((𝜑𝑥𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐴 = 𝑥)
11 tgbtwnswapid.2 . . . . 5 (𝜑𝐵𝑃)
1211ad2antrr 725 . . . 4 (((𝜑𝑥𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐵𝑃)
13 simprr 772 . . . 4 (((𝜑𝑥𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝑥 ∈ (𝐵𝐼𝐵))
141, 2, 3, 5, 12, 8, 13axtgbtwnid 26263 . . 3 (((𝜑𝑥𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐵 = 𝑥)
1510, 14eqtr4d 2839 . 2 (((𝜑𝑥𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐴 = 𝐵)
16 tgbtwnswapid.3 . . 3 (𝜑𝐶𝑃)
17 tgbtwnswapid.4 . . 3 (𝜑𝐴 ∈ (𝐵𝐼𝐶))
18 tgbtwnswapid.5 . . 3 (𝜑𝐵 ∈ (𝐴𝐼𝐶))
191, 2, 3, 4, 11, 6, 16, 6, 11, 17, 18axtgpasch 26264 . 2 (𝜑 → ∃𝑥𝑃 (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵)))
2015, 19r19.29a 3251 1 (𝜑𝐴 = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wcel 2112  cfv 6328  (class class class)co 7139  Basecbs 16478  distcds 16569  TarskiGcstrkg 26227  Itvcitv 26233
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-nul 5177
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ral 3114  df-rex 3115  df-rab 3118  df-v 3446  df-sbc 3724  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4247  df-pw 4502  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4804  df-br 5034  df-iota 6287  df-fv 6336  df-ov 7142  df-trkgb 26246  df-trkg 26250
This theorem is referenced by:  legtri3  26387
  Copyright terms: Public domain W3C validator