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

Theorem tgbtwnswapid 28964
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 739 . . . 4 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐺 ∈ TarskiG)
6 tgbtwnswapid.1 . . . . 5 (𝜑 → 𝐴 ∈ 𝑃)
76ad2antrr 739 . . . 4 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐴 ∈ 𝑃)
8 simplr 781 . . . 4 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝑥 ∈ 𝑃)
9 simprl 783 . . . 4 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝑥 ∈ (𝐴𝐼𝐴))
101, 2, 3, 5, 7, 8, 9axtgbtwnid 28937 . . 3 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐴 = 𝑥)
11 tgbtwnswapid.2 . . . . 5 (𝜑 → 𝐵 ∈ 𝑃)
1211ad2antrr 739 . . . 4 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐵 ∈ 𝑃)
13 simprr 785 . . . 4 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝑥 ∈ (𝐵𝐼𝐵))
141, 2, 3, 5, 12, 8, 13axtgbtwnid 28937 . . 3 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐵 = 𝑥)
1510, 14eqtr4d 2798 . 2 (((𝜑 ∧ 𝑥 ∈ 𝑃) ∧ (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵))) → 𝐴 = 𝐵)
16 tgbtwnswapid.3 . . 3 (𝜑 → 𝐶 ∈ 𝑃)
17 tgbtwnswapid.4 . . 3 (𝜑 → 𝐴 ∈ (𝐵𝐼𝐶))
18 tgbtwnswapid.5 . . 3 (𝜑 → 𝐵 ∈ (𝐴𝐼𝐶))
191, 2, 3, 4, 11, 6, 16, 6, 11, 17, 18axtgpasch 28938 . 2 (𝜑 → ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐴𝐼𝐴) ∧ 𝑥 ∈ (𝐵𝐼𝐵)))
2015, 19r19.29a 3170 1 (𝜑 → 𝐴 = 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ‘cfv 6543  (class class class)co 7424  Basecbs 17396  distcds 17446  TarskiGcstrkg 28898  Itvcitv 28904
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-nul 5259
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6497  df-fv 6551  df-ov 7427  df-trkgb 28920  df-trkg 28924
This theorem is used by:  legtri3  29062
  Copyright terms: Public domain W3C validator