| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ismir | Structured version Visualization version GIF version | ||
| Description: Property of the image by the point inversion function. Definition 7.5 of [Schwabhauser] p. 49. (Contributed by Thierry Arnoux, 3-Jun-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 | ⊢ 𝑀 = (𝑆‘𝐴) |
| mirfv.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| ismir.1 | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| ismir.2 | ⊢ (𝜑 → (𝐴 − 𝐶) = (𝐴 − 𝐵)) |
| ismir.3 | ⊢ (𝜑 → 𝐴 ∈ (𝐶𝐼𝐵)) |
| Ref | Expression |
|---|---|
| ismir | ⊢ (𝜑 → 𝐶 = (𝑀‘𝐵)) |
| Step | Hyp | Ref | 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 | mirfv.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 10 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | mirfv 29185 | . 2 ⊢ (𝜑 → (𝑀‘𝐵) = (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵)))) |
| 11 | ismir.2 | . . 3 ⊢ (𝜑 → (𝐴 − 𝐶) = (𝐴 − 𝐵)) | |
| 12 | ismir.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ (𝐶𝐼𝐵)) | |
| 13 | ismir.1 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 14 | 1, 2, 3, 6, 9, 7 | mirreu3 29183 | . . . 4 ⊢ (𝜑 → ∃!𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) |
| 15 | oveq2 7459 | . . . . . . 7 ⊢ (𝑧 = 𝐶 → (𝐴 − 𝑧) = (𝐴 − 𝐶)) | |
| 16 | 15 | eqeq1d 2765 | . . . . . 6 ⊢ (𝑧 = 𝐶 → ((𝐴 − 𝑧) = (𝐴 − 𝐵) ↔ (𝐴 − 𝐶) = (𝐴 − 𝐵))) |
| 17 | oveq1 7458 | . . . . . . 7 ⊢ (𝑧 = 𝐶 → (𝑧𝐼𝐵) = (𝐶𝐼𝐵)) | |
| 18 | 17 | eleq2d 2850 | . . . . . 6 ⊢ (𝑧 = 𝐶 → (𝐴 ∈ (𝑧𝐼𝐵) ↔ 𝐴 ∈ (𝐶𝐼𝐵))) |
| 19 | 16, 18 | anbi12d 644 | . . . . 5 ⊢ (𝑧 = 𝐶 → (((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵)) ↔ ((𝐴 − 𝐶) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝐶𝐼𝐵)))) |
| 20 | 19 | riota2 7433 | . . . 4 ⊢ ((𝐶 ∈ 𝑃 ∧ ∃!𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) → (((𝐴 − 𝐶) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝐶𝐼𝐵)) ↔ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) = 𝐶)) |
| 21 | 13, 14, 20 | syl2anc 596 | . . 3 ⊢ (𝜑 → (((𝐴 − 𝐶) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝐶𝐼𝐵)) ↔ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) = 𝐶)) |
| 22 | 11, 12, 21 | mpbi2and 725 | . 2 ⊢ (𝜑 → (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) = 𝐶) |
| 23 | 10, 22 | eqtr2d 2799 | 1 ⊢ (𝜑 → 𝐶 = (𝑀‘𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∃!wreu 3367 ‘cfv 6566 ℩crio 7407 (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: mirmir 29191 mireq 29194 mirinv 29195 miriso 29199 mirmir2 29203 mirauto 29213 colmid 29217 krippenlem 29219 midexlem 29221 mideulem2 29267 opphllem 29268 midcom 29344 trgcopyeulem 29369 |
| Copyright terms: Public domain | W3C validator |