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

Theorem tgcgrextend 28712
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 485 . . 3 ((𝜑𝐴 = 𝐵) → (𝐵 𝐶) = (𝐸 𝐹))
3 simpr 489 . . . 4 ((𝜑𝐴 = 𝐵) → 𝐴 = 𝐵)
43oveq1d 7415 . . 3 ((𝜑𝐴 = 𝐵) → (𝐴 𝐶) = (𝐵 𝐶))
5 tkgeom.p . . . . 5 𝑃 = (Base‘𝐺)
6 tkgeom.d . . . . 5 = (dist‘𝐺)
7 tkgeom.i . . . . 5 𝐼 = (Itv‘𝐺)
8 tkgeom.g . . . . . 6 (𝜑𝐺 ∈ TarskiG)
98adantr 485 . . . . 5 ((𝜑𝐴 = 𝐵) → 𝐺 ∈ TarskiG)
10 tgcgrextend.a . . . . . 6 (𝜑𝐴𝑃)
1110adantr 485 . . . . 5 ((𝜑𝐴 = 𝐵) → 𝐴𝑃)
12 tgcgrextend.b . . . . . 6 (𝜑𝐵𝑃)
1312adantr 485 . . . . 5 ((𝜑𝐴 = 𝐵) → 𝐵𝑃)
14 tgcgrextend.d . . . . . 6 (𝜑𝐷𝑃)
1514adantr 485 . . . . 5 ((𝜑𝐴 = 𝐵) → 𝐷𝑃)
16 tgcgrextend.e . . . . . 6 (𝜑𝐸𝑃)
1716adantr 485 . . . . 5 ((𝜑𝐴 = 𝐵) → 𝐸𝑃)
18 tgcgrextend.3 . . . . . 6 (𝜑 → (𝐴 𝐵) = (𝐷 𝐸))
1918adantr 485 . . . . 5 ((𝜑𝐴 = 𝐵) → (𝐴 𝐵) = (𝐷 𝐸))
205, 6, 7, 9, 11, 13, 15, 17, 19, 3tgcgreq 28709 . . . 4 ((𝜑𝐴 = 𝐵) → 𝐷 = 𝐸)
2120oveq1d 7415 . . 3 ((𝜑𝐴 = 𝐵) → (𝐷 𝐹) = (𝐸 𝐹))
222, 4, 213eqtr4d 2810 . 2 ((𝜑𝐴 = 𝐵) → (𝐴 𝐶) = (𝐷 𝐹))
238adantr 485 . . 3 ((𝜑𝐴𝐵) → 𝐺 ∈ TarskiG)
24 tgcgrextend.c . . . 4 (𝜑𝐶𝑃)
2524adantr 485 . . 3 ((𝜑𝐴𝐵) → 𝐶𝑃)
2610adantr 485 . . 3 ((𝜑𝐴𝐵) → 𝐴𝑃)
27 tgcgrextend.f . . . 4 (𝜑𝐹𝑃)
2827adantr 485 . . 3 ((𝜑𝐴𝐵) → 𝐹𝑃)
2914adantr 485 . . 3 ((𝜑𝐴𝐵) → 𝐷𝑃)
3012adantr 485 . . . 4 ((𝜑𝐴𝐵) → 𝐵𝑃)
3116adantr 485 . . . 4 ((𝜑𝐴𝐵) → 𝐸𝑃)
32 simpr 489 . . . 4 ((𝜑𝐴𝐵) → 𝐴𝐵)
33 tgcgrextend.1 . . . . 5 (𝜑𝐵 ∈ (𝐴𝐼𝐶))
3433adantr 485 . . . 4 ((𝜑𝐴𝐵) → 𝐵 ∈ (𝐴𝐼𝐶))
35 tgcgrextend.2 . . . . 5 (𝜑𝐸 ∈ (𝐷𝐼𝐹))
3635adantr 485 . . . 4 ((𝜑𝐴𝐵) → 𝐸 ∈ (𝐷𝐼𝐹))
3718adantr 485 . . . 4 ((𝜑𝐴𝐵) → (𝐴 𝐵) = (𝐷 𝐸))
381adantr 485 . . . 4 ((𝜑𝐴𝐵) → (𝐵 𝐶) = (𝐸 𝐹))
395, 6, 7, 23, 26, 29tgcgrtriv 28711 . . . 4 ((𝜑𝐴𝐵) → (𝐴 𝐴) = (𝐷 𝐷))
405, 6, 7, 23, 26, 30, 29, 31, 37tgcgrcomlr 28707 . . . 4 ((𝜑𝐴𝐵) → (𝐵 𝐴) = (𝐸 𝐷))
415, 6, 7, 23, 26, 30, 25, 29, 31, 28, 26, 29, 32, 34, 36, 37, 38, 39, 40axtg5seg 28692 . . 3 ((𝜑𝐴𝐵) → (𝐶 𝐴) = (𝐹 𝐷))
425, 6, 7, 23, 25, 26, 28, 29, 41tgcgrcomlr 28707 . 2 ((𝜑𝐴𝐵) → (𝐴 𝐶) = (𝐷 𝐹))
4322, 42pm2.61dane 3047 1 (𝜑 → (𝐴 𝐶) = (𝐷 𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  wcel 2145  wne 2960  cfv 6525  (class class class)co 7400  Basecbs 17259  distcds 17309  TarskiGcstrkg 28654  Itvcitv 28660
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-nul 5261
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-iota 6481  df-fv 6533  df-ov 7403  df-trkgc 28675  df-trkgcb 28677  df-trkg 28680
This theorem is referenced by:  tgsegconeq  28713  tgcgrxfr  28745  lnext  28794  tgbtwnconn1lem1  28799  tgbtwnconn1lem2  28800  tgbtwnconn1lem3  28801  miriso  28901  mircgrextend  28913  midexlem  28923  opphllem  28966  flatcgra  29076  dfcgra2  29082
  Copyright terms: Public domain W3C validator