| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mirinv | Structured version Visualization version GIF version | ||
| 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.) |
| 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 | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| Ref | Expression |
|---|---|
| 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 29139 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 ∈ ((𝑀‘𝐵)𝐼𝐵)) |
| 14 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → (𝑀‘𝐵) = 𝐵) | |
| 15 | 14 | oveq1d 7439 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → ((𝑀‘𝐵)𝐼𝐵) = (𝐵𝐼𝐵)) |
| 16 | 13, 15 | eleqtrd 2862 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 ∈ (𝐵𝐼𝐵)) |
| 17 | 1, 2, 3, 5, 7, 9, 16 | axtgbtwnid 28937 | . . 3 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐵 = 𝐴) |
| 18 | 17 | eqcomd 2766 | . 2 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 = 𝐵) |
| 19 | 4 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐺 ∈ TarskiG) |
| 20 | 8 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ∈ 𝑃) |
| 21 | 6 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 ∈ 𝑃) |
| 22 | eqidd 2761 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝐴 − 𝐵) = (𝐴 − 𝐵)) | |
| 23 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵) | |
| 24 | 1, 2, 3, 19, 21, 21 | tgbtwntriv1 28963 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 ∈ (𝐵𝐼𝐵)) |
| 25 | 23, 24 | eqeltrd 2860 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐴 ∈ (𝐵𝐼𝐵)) |
| 26 | 1, 2, 3, 10, 11, 19, 20, 12, 21, 21, 22, 25 | ismir 29140 | . . 3 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → 𝐵 = (𝑀‘𝐵)) |
| 27 | 26 | eqcomd 2766 | . 2 ⊢ ((𝜑 ∧ 𝐴 = 𝐵) → (𝑀‘𝐵) = 𝐵) |
| 28 | 18, 27 | impbida 813 | 1 ⊢ (𝜑 → ((𝑀‘𝐵) = 𝐵 ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ‘cfv 6543 (class class class)co 7424 Basecbs 17396 distcds 17446 TarskiGcstrkg 28898 Itvcitv 28904 LineGclng 28905 pInvGcmir 29133 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 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 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-trkgc 28919 df-trkgb 28920 df-trkgcb 28921 df-trkg 28924 df-mir 29134 |
| This theorem is used by: mirne 29148 mircinv 29149 mirln2 29158 miduniq 29166 miduniq2 29168 krippenlem 29171 ragflat2 29187 footexALT 29202 footexlem1 29203 footexlem2 29204 colperpexlem2 29216 colperpexlem3 29217 opphllem6 29237 lmimid 29308 hypcgrlem2 29315 tgextamirnhl 33081 |
| Copyright terms: Public domain | W3C validator |