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

Theorem mireq 25977
 Description: Equality deduction for point inversion. Theorem 7.9 of [Schwabhauser] p. 50. (Contributed by Thierry Arnoux, 30-May-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 𝑀 = (𝑆𝐴)
mirmir.b (𝜑𝐵𝑃)
mireq.c (𝜑𝐶𝑃)
mireq.d (𝜑 → (𝑀𝐵) = (𝑀𝐶))
Assertion
Ref Expression
mireq (𝜑𝐵 = 𝐶)

Proof of Theorem mireq
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 mirval.p . . 3 𝑃 = (Base‘𝐺)
2 mirval.d . . 3 = (dist‘𝐺)
3 mirval.i . . 3 𝐼 = (Itv‘𝐺)
4 mirval.l . . 3 𝐿 = (LineG‘𝐺)
5 mirval.s . . 3 𝑆 = (pInvG‘𝐺)
6 mirval.g . . 3 (𝜑𝐺 ∈ TarskiG)
7 mirval.a . . 3 (𝜑𝐴𝑃)
8 mirfv.m . . 3 𝑀 = (𝑆𝐴)
9 mireq.c . . . 4 (𝜑𝐶𝑃)
101, 2, 3, 4, 5, 6, 7, 8, 9mircl 25973 . . 3 (𝜑 → (𝑀𝐶) ∈ 𝑃)
11 mirmir.b . . 3 (𝜑𝐵𝑃)
121, 2, 3, 4, 5, 6, 7, 8, 11mirfv 25968 . . . . . . 7 (𝜑 → (𝑀𝐵) = (𝑧𝑃 ((𝐴 𝑧) = (𝐴 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))))
13 mireq.d . . . . . . 7 (𝜑 → (𝑀𝐵) = (𝑀𝐶))
1412, 13eqtr3d 2863 . . . . . 6 (𝜑 → (𝑧𝑃 ((𝐴 𝑧) = (𝐴 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) = (𝑀𝐶))
151, 2, 3, 6, 11, 7mirreu3 25966 . . . . . . 7 (𝜑 → ∃!𝑧𝑃 ((𝐴 𝑧) = (𝐴 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵)))
16 oveq2 6913 . . . . . . . . . 10 (𝑧 = (𝑀𝐶) → (𝐴 𝑧) = (𝐴 (𝑀𝐶)))
1716eqeq1d 2827 . . . . . . . . 9 (𝑧 = (𝑀𝐶) → ((𝐴 𝑧) = (𝐴 𝐵) ↔ (𝐴 (𝑀𝐶)) = (𝐴 𝐵)))
18 oveq1 6912 . . . . . . . . . 10 (𝑧 = (𝑀𝐶) → (𝑧𝐼𝐵) = ((𝑀𝐶)𝐼𝐵))
1918eleq2d 2892 . . . . . . . . 9 (𝑧 = (𝑀𝐶) → (𝐴 ∈ (𝑧𝐼𝐵) ↔ 𝐴 ∈ ((𝑀𝐶)𝐼𝐵)))
2017, 19anbi12d 624 . . . . . . . 8 (𝑧 = (𝑀𝐶) → (((𝐴 𝑧) = (𝐴 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵)) ↔ ((𝐴 (𝑀𝐶)) = (𝐴 𝐵) ∧ 𝐴 ∈ ((𝑀𝐶)𝐼𝐵))))
2120riota2 6888 . . . . . . 7 (((𝑀𝐶) ∈ 𝑃 ∧ ∃!𝑧𝑃 ((𝐴 𝑧) = (𝐴 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) → (((𝐴 (𝑀𝐶)) = (𝐴 𝐵) ∧ 𝐴 ∈ ((𝑀𝐶)𝐼𝐵)) ↔ (𝑧𝑃 ((𝐴 𝑧) = (𝐴 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) = (𝑀𝐶)))
2210, 15, 21syl2anc 579 . . . . . 6 (𝜑 → (((𝐴 (𝑀𝐶)) = (𝐴 𝐵) ∧ 𝐴 ∈ ((𝑀𝐶)𝐼𝐵)) ↔ (𝑧𝑃 ((𝐴 𝑧) = (𝐴 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) = (𝑀𝐶)))
2314, 22mpbird 249 . . . . 5 (𝜑 → ((𝐴 (𝑀𝐶)) = (𝐴 𝐵) ∧ 𝐴 ∈ ((𝑀𝐶)𝐼𝐵)))
2423simpld 490 . . . 4 (𝜑 → (𝐴 (𝑀𝐶)) = (𝐴 𝐵))
2524eqcomd 2831 . . 3 (𝜑 → (𝐴 𝐵) = (𝐴 (𝑀𝐶)))
2623simprd 491 . . . 4 (𝜑𝐴 ∈ ((𝑀𝐶)𝐼𝐵))
271, 2, 3, 6, 10, 7, 11, 26tgbtwncom 25800 . . 3 (𝜑𝐴 ∈ (𝐵𝐼(𝑀𝐶)))
281, 2, 3, 4, 5, 6, 7, 8, 10, 11, 25, 27ismir 25971 . 2 (𝜑𝐵 = (𝑀‘(𝑀𝐶)))
291, 2, 3, 4, 5, 6, 7, 8, 9mirmir 25974 . 2 (𝜑 → (𝑀‘(𝑀𝐶)) = 𝐶)
3028, 29eqtrd 2861 1 (𝜑𝐵 = 𝐶)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 198   ∧ wa 386   = wceq 1656   ∈ wcel 2164  ∃!wreu 3119  ‘cfv 6123  ℩crio 6865  (class class class)co 6905  Basecbs 16222  distcds 16314  TarskiGcstrkg 25742  Itvcitv 25748  LineGclng 25749  pInvGcmir 25964 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1894  ax-4 1908  ax-5 2009  ax-6 2075  ax-7 2112  ax-9 2173  ax-10 2192  ax-11 2207  ax-12 2220  ax-13 2389  ax-ext 2803  ax-rep 4994  ax-sep 5005  ax-nul 5013  ax-pr 5127 This theorem depends on definitions:  df-bi 199  df-an 387  df-or 879  df-3an 1113  df-tru 1660  df-ex 1879  df-nf 1883  df-sb 2068  df-mo 2605  df-eu 2640  df-clab 2812  df-cleq 2818  df-clel 2821  df-nfc 2958  df-ne 3000  df-ral 3122  df-rex 3123  df-reu 3124  df-rmo 3125  df-rab 3126  df-v 3416  df-sbc 3663  df-csb 3758  df-dif 3801  df-un 3803  df-in 3805  df-ss 3812  df-nul 4145  df-if 4307  df-pw 4380  df-sn 4398  df-pr 4400  df-op 4404  df-uni 4659  df-iun 4742  df-br 4874  df-opab 4936  df-mpt 4953  df-id 5250  df-xp 5348  df-rel 5349  df-cnv 5350  df-co 5351  df-dm 5352  df-rn 5353  df-res 5354  df-ima 5355  df-iota 6086  df-fun 6125  df-fn 6126  df-f 6127  df-f1 6128  df-fo 6129  df-f1o 6130  df-fv 6131  df-riota 6866  df-ov 6908  df-trkgc 25760  df-trkgb 25761  df-trkgcb 25762  df-trkg 25765  df-mir 25965 This theorem is referenced by:  mirhl  25991  mirbtwnhl  25992  mirhl2  25993  colperpexlem3  26041
 Copyright terms: Public domain W3C validator