Theorem mirinv 29131

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

Step	Hyp	Ref	Expression
1		mirval.p	. . . 4 ⊢ 𝑃 = (Base‘𝐺)
2		mirval.d	. . . 4 ⊢ − = (dist‘𝐺)
3		mirval.i	. . . 4 ⊢ 𝐼 = (Itv‘𝐺)
4		mirval.g	. . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
5	4	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐺 ∈ TarskiG)
6		mirinv.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
7	6	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐵 ∈ 𝑃)
8		mirval.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
9	8	adantr 486	. . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 ∈ 𝑃)
10		mirval.l	. . . . . 6 ⊢ 𝐿 = (LineG‘𝐺)
11		mirval.s	. . . . . 6 ⊢ 𝑆 = (pInvG‘𝐺)
12		mirfv.m	. . . . . 6 ⊢ 𝑀 = (𝑆‘𝐴)
13	1, 2, 3, 10, 11, 5, 9, 12, 7	mirbtwn 29123	. . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 ∈ ((𝑀‘𝐵)𝐼𝐵))
14		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → (𝑀‘𝐵) = 𝐵)
15	14	oveq1d 7433	. . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → ((𝑀‘𝐵)𝐼𝐵) = (𝐵𝐼𝐵))
16	13, 15	eleqtrd 2863	. . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 ∈ (𝐵𝐼𝐵))
17	1, 2, 3, 5, 7, 9, 16	axtgbtwnid 28921	. . 3 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐵 = 𝐴)
18	17	eqcomd 2767	. 2 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 = 𝐵)
19	4	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐺 ∈ TarskiG)
20	8	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ∈ 𝑃)
21	6	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 ∈ 𝑃)
22		eqidd 2762	. . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐴 − 𝐵) = (𝐴 − 𝐵))
23		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵)
24	1, 2, 3, 19, 21, 21	tgbtwntriv1 28947	. . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 ∈ (𝐵𝐼𝐵))
25	23, 24	eqeltrd 2861	. . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ∈ (𝐵𝐼𝐵))
26	1, 2, 3, 10, 11, 19, 20, 12, 21, 21, 22, 25	ismir 29124	. . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 = (𝑀‘𝐵))
27	26	eqcomd 2767	. 2 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝑀‘𝐵) = 𝐵)
28	18, 27	impbida 813	1 ⊢ (𝜑 → ((𝑀‘𝐵) = 𝐵 ↔ 𝐴 = 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  distcds 17430  TarskiGcstrkg 28882  Itvcitv 28888  LineGclng 28889  pInvGcmir 29117

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7375  df-ov 7421  df-trkgc 28903  df-trkgb 28904  df-trkgcb 28905  df-trkg 28908  df-mir 29118

This theorem is used by:  mirne  29132  mircinv  29133  mirln2  29142  miduniq  29150  miduniq2  29152  krippenlem  29155  ragflat2  29171  footexALT  29186  footexlem1  29187  footexlem2  29188  colperpexlem2  29200  colperpexlem3  29201  opphllem6  29221  lmimid  29292  hypcgrlem2  29299