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

Theorem mirinv 29195
Description: The only invariant point of a point inversion Theorem 7.3 of [Schwabhauser] p. 49, Theorem 7.10 of [Schwabhauser] p. 50. (Contributed by Thierry Arnoux, 30-Jul-2019.)
Hypotheses
Ref Expression
mirval.p 𝑃 = (Base‘𝐺)
mirval.d − = (dist‘𝐺)
mirval.i 𝐼 = (Itv‘𝐺)
mirval.l 𝐿 = (LineG‘𝐺)
mirval.s 𝑆 = (pInvG‘𝐺)
mirval.g (𝜑 → 𝐺 ∈ TarskiG)
mirval.a (𝜑 → 𝐴 ∈ 𝑃)
mirfv.m 𝑀 = (𝑆‘𝐴)
mirinv.b (𝜑 → 𝐵 ∈ 𝑃)
Assertion
Ref Expression
mirinv (𝜑 → ((𝑀‘𝐵) = 𝐵 ↔ 𝐴 = 𝐵))

Proof of Theorem mirinv
StepHypRef Expression
1 mirval.p . . . 4 𝑃 = (Base‘𝐺)
2 mirval.d . . . 4 − = (dist‘𝐺)
3 mirval.i . . . 4 𝐼 = (Itv‘𝐺)
4 mirval.g . . . . 5 (𝜑 → 𝐺 ∈ TarskiG)
54adantr 486 . . . 4 ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐺 ∈ TarskiG)
6 mirinv.b . . . . 5 (𝜑 → 𝐵 ∈ 𝑃)
76adantr 486 . . . 4 ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐵 ∈ 𝑃)
8 mirval.a . . . . 5 (𝜑 → 𝐴 ∈ 𝑃)
98adantr 486 . . . 4 ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 ∈ 𝑃)
10 mirval.l . . . . . 6 𝐿 = (LineG‘𝐺)
11 mirval.s . . . . . 6 𝑆 = (pInvG‘𝐺)
12 mirfv.m . . . . . 6 𝑀 = (𝑆‘𝐴)
131, 2, 3, 10, 11, 5, 9, 12, 7mirbtwn 29187 . . . . 5 ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 ∈ ((𝑀‘𝐵)𝐼𝐵))
14 simpr 490 . . . . . 6 ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → (𝑀‘𝐵) = 𝐵)
1514oveq1d 7466 . . . . 5 ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → ((𝑀‘𝐵)𝐼𝐵) = (𝐵𝐼𝐵))
1613, 15eleqtrd 2866 . . . 4 ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 ∈ (𝐵𝐼𝐵))
171, 2, 3, 5, 7, 9, 16axtgbtwnid 28985 . . 3 ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐵 = 𝐴)
1817eqcomd 2769 . 2 ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 = 𝐵)
194adantr 486 . . . 4 ((𝜑 ∧ 𝐴 = 𝐵) → 𝐺 ∈ TarskiG)
208adantr 486 . . . 4 ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ∈ 𝑃)
216adantr 486 . . . 4 ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 ∈ 𝑃)
22 eqidd 2764 . . . 4 ((𝜑 ∧ 𝐴 = 𝐵) → (𝐴 − 𝐵) = (𝐴 − 𝐵))
23 simpr 490 . . . . 5 ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵)
241, 2, 3, 19, 21, 21tgbtwntriv1 29011 . . . . 5 ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 ∈ (𝐵𝐼𝐵))
2523, 24eqeltrd 2864 . . . 4 ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ∈ (𝐵𝐼𝐵))
261, 2, 3, 10, 11, 19, 20, 12, 21, 21, 22, 25ismir 29188 . . 3 ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 = (𝑀‘𝐵))
2726eqcomd 2769 . 2 ((𝜑 ∧ 𝐴 = 𝐵) → (𝑀‘𝐵) = 𝐵)
2818, 27impbida 813 1 (𝜑 → ((𝑀‘𝐵) = 𝐵 ↔ 𝐴 = 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  distcds 17481  TarskiGcstrkg 28946  Itvcitv 28952  LineGclng 28953  pInvGcmir 29181
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398
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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-trkgc 28967  df-trkgb 28968  df-trkgcb 28969  df-trkg 28972  df-mir 29182
This theorem is used by:  mirne  29196  mircinv  29197  mirln2  29206  miduniq  29214  miduniq2  29216  krippenlem  29219  ragflat2  29235  footexALT  29250  footexlem1  29251  footexlem2  29252  colperpexlem2  29264  colperpexlem3  29265  opphllem6  29285  lmimid  29356  hypcgrlem2  29363  tgextamirnhl  33129
  Copyright terms: Public domain W3C validator