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

Theorem tgcgrextend 28791
Description: Link congruence over a pair of line segments. Theorem 2.11 of [Schwabhauser] p. 29. (Contributed by Thierry Arnoux, 23-Mar-2019.) (Shortened by David A. Wheeler and Thierry Arnoux, 22-Apr-2020.)
Hypotheses
Ref Expression
tkgeom.p 𝑃 = (Base‘𝐺)
tkgeom.d = (dist‘𝐺)
tkgeom.i 𝐼 = (Itv‘𝐺)
tkgeom.g (𝜑𝐺 ∈ TarskiG)
tgcgrextend.a (𝜑𝐴𝑃)
tgcgrextend.b (𝜑𝐵𝑃)
tgcgrextend.c (𝜑𝐶𝑃)
tgcgrextend.d (𝜑𝐷𝑃)
tgcgrextend.e (𝜑𝐸𝑃)
tgcgrextend.f (𝜑𝐹𝑃)
tgcgrextend.1 (𝜑𝐵 ∈ (𝐴𝐼𝐶))
tgcgrextend.2 (𝜑𝐸 ∈ (𝐷𝐼𝐹))
tgcgrextend.3 (𝜑 → (𝐴 𝐵) = (𝐷 𝐸))
tgcgrextend.4 (𝜑 → (𝐵 𝐶) = (𝐸 𝐹))
Assertion
Ref Expression
tgcgrextend (𝜑 → (𝐴 𝐶) = (𝐷 𝐹))

Proof of Theorem tgcgrextend
StepHypRef Expression
1 tgcgrextend.4 . . . 4 (𝜑 → (𝐵 𝐶) = (𝐸 𝐹))
21adantr 486 . . 3 ((𝜑𝐴 = 𝐵) → (𝐵 𝐶) = (𝐸 𝐹))
3 simpr 490 . . . 4 ((𝜑𝐴 = 𝐵) → 𝐴 = 𝐵)
43oveq1d 7438 . . 3 ((𝜑𝐴 = 𝐵) → (𝐴 𝐶) = (𝐵 𝐶))
5 tkgeom.p . . . . 5 𝑃 = (Base‘𝐺)
6 tkgeom.d . . . . 5 = (dist‘𝐺)
7 tkgeom.i . . . . 5 𝐼 = (Itv‘𝐺)
8 tkgeom.g . . . . . 6 (𝜑𝐺 ∈ TarskiG)
98adantr 486 . . . . 5 ((𝜑𝐴 = 𝐵) → 𝐺 ∈ TarskiG)
10 tgcgrextend.a . . . . . 6 (𝜑𝐴𝑃)
1110adantr 486 . . . . 5 ((𝜑𝐴 = 𝐵) → 𝐴𝑃)
12 tgcgrextend.b . . . . . 6 (𝜑𝐵𝑃)
1312adantr 486 . . . . 5 ((𝜑𝐴 = 𝐵) → 𝐵𝑃)
14 tgcgrextend.d . . . . . 6 (𝜑𝐷𝑃)
1514adantr 486 . . . . 5 ((𝜑𝐴 = 𝐵) → 𝐷𝑃)
16 tgcgrextend.e . . . . . 6 (𝜑𝐸𝑃)
1716adantr 486 . . . . 5 ((𝜑𝐴 = 𝐵) → 𝐸𝑃)
18 tgcgrextend.3 . . . . . 6 (𝜑 → (𝐴 𝐵) = (𝐷 𝐸))
1918adantr 486 . . . . 5 ((𝜑𝐴 = 𝐵) → (𝐴 𝐵) = (𝐷 𝐸))
205, 6, 7, 9, 11, 13, 15, 17, 19, 3tgcgreq 28788 . . . 4 ((𝜑𝐴 = 𝐵) → 𝐷 = 𝐸)
2120oveq1d 7438 . . 3 ((𝜑𝐴 = 𝐵) → (𝐷 𝐹) = (𝐸 𝐹))
222, 4, 213eqtr4d 2811 . 2 ((𝜑𝐴 = 𝐵) → (𝐴 𝐶) = (𝐷 𝐹))
238adantr 486 . . 3 ((𝜑𝐴𝐵) → 𝐺 ∈ TarskiG)
24 tgcgrextend.c . . . 4 (𝜑𝐶𝑃)
2524adantr 486 . . 3 ((𝜑𝐴𝐵) → 𝐶𝑃)
2610adantr 486 . . 3 ((𝜑𝐴𝐵) → 𝐴𝑃)
27 tgcgrextend.f . . . 4 (𝜑𝐹𝑃)
2827adantr 486 . . 3 ((𝜑𝐴𝐵) → 𝐹𝑃)
2914adantr 486 . . 3 ((𝜑𝐴𝐵) → 𝐷𝑃)
3012adantr 486 . . . 4 ((𝜑𝐴𝐵) → 𝐵𝑃)
3116adantr 486 . . . 4 ((𝜑𝐴𝐵) → 𝐸𝑃)
32 simpr 490 . . . 4 ((𝜑𝐴𝐵) → 𝐴𝐵)
33 tgcgrextend.1 . . . . 5 (𝜑𝐵 ∈ (𝐴𝐼𝐶))
3433adantr 486 . . . 4 ((𝜑𝐴𝐵) → 𝐵 ∈ (𝐴𝐼𝐶))
35 tgcgrextend.2 . . . . 5 (𝜑𝐸 ∈ (𝐷𝐼𝐹))
3635adantr 486 . . . 4 ((𝜑𝐴𝐵) → 𝐸 ∈ (𝐷𝐼𝐹))
3718adantr 486 . . . 4 ((𝜑𝐴𝐵) → (𝐴 𝐵) = (𝐷 𝐸))
381adantr 486 . . . 4 ((𝜑𝐴𝐵) → (𝐵 𝐶) = (𝐸 𝐹))
395, 6, 7, 23, 26, 29tgcgrtriv 28790 . . . 4 ((𝜑𝐴𝐵) → (𝐴 𝐴) = (𝐷 𝐷))
405, 6, 7, 23, 26, 30, 29, 31, 37tgcgrcomlr 28786 . . . 4 ((𝜑𝐴𝐵) → (𝐵 𝐴) = (𝐸 𝐷))
415, 6, 7, 23, 26, 30, 25, 29, 31, 28, 26, 29, 32, 34, 36, 37, 38, 39, 40axtg5seg 28771 . . 3 ((𝜑𝐴𝐵) → (𝐶 𝐴) = (𝐹 𝐷))
425, 6, 7, 23, 25, 26, 28, 29, 41tgcgrcomlr 28786 . 2 ((𝜑𝐴𝐵) → (𝐴 𝐶) = (𝐷 𝐹))
4322, 42pm2.61dane 3048 1 (𝜑 → (𝐴 𝐶) = (𝐷 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  wne 2961  cfv 6543  (class class class)co 7423  Basecbs 17294  distcds 17344  TarskiGcstrkg 28733  Itvcitv 28739
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 2148  ax-9 2156  ax-ext 2738  ax-nul 5274
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 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-iota 6499  df-fv 6551  df-ov 7426  df-trkgc 28754  df-trkgcb 28756  df-trkg 28759
This theorem is used by:  tgsegconeq  28792  tgcgrxfr  28824  lnext  28873  tgbtwnconn1lem1  28878  tgbtwnconn1lem2  28879  tgbtwnconn1lem3  28880  miriso  28984  mircgrextend  28996  midexlem  29006  opphllem  29053  flatcgra  29172  dfcgra2  29178
  Copyright terms: Public domain W3C validator