![]() |
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 25772 | . 2 ⊢ (𝜑 → (𝑀‘𝐵) = (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵)))) |
11 | ismir.2 | . . 3 ⊢ (𝜑 → (𝐴 − 𝐶) = (𝐴 − 𝐵)) | |
12 | ismir.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ (𝐶𝐼𝐵)) | |
13 | ismir.1 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
14 | 1, 2, 3, 6, 9, 7 | mirreu3 25770 | . . . 4 ⊢ (𝜑 → ∃!𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) |
15 | oveq2 6801 | . . . . . . 7 ⊢ (𝑧 = 𝐶 → (𝐴 − 𝑧) = (𝐴 − 𝐶)) | |
16 | 15 | eqeq1d 2773 | . . . . . 6 ⊢ (𝑧 = 𝐶 → ((𝐴 − 𝑧) = (𝐴 − 𝐵) ↔ (𝐴 − 𝐶) = (𝐴 − 𝐵))) |
17 | oveq1 6800 | . . . . . . 7 ⊢ (𝑧 = 𝐶 → (𝑧𝐼𝐵) = (𝐶𝐼𝐵)) | |
18 | 17 | eleq2d 2836 | . . . . . 6 ⊢ (𝑧 = 𝐶 → (𝐴 ∈ (𝑧𝐼𝐵) ↔ 𝐴 ∈ (𝐶𝐼𝐵))) |
19 | 16, 18 | anbi12d 616 | . . . . 5 ⊢ (𝑧 = 𝐶 → (((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵)) ↔ ((𝐴 − 𝐶) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝐶𝐼𝐵)))) |
20 | 19 | riota2 6776 | . . . 4 ⊢ ((𝐶 ∈ 𝑃 ∧ ∃!𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) → (((𝐴 − 𝐶) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝐶𝐼𝐵)) ↔ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) = 𝐶)) |
21 | 13, 14, 20 | syl2anc 573 | . . 3 ⊢ (𝜑 → (((𝐴 − 𝐶) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝐶𝐼𝐵)) ↔ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) = 𝐶)) |
22 | 11, 12, 21 | mpbi2and 691 | . 2 ⊢ (𝜑 → (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝐵) ∧ 𝐴 ∈ (𝑧𝐼𝐵))) = 𝐶) |
23 | 10, 22 | eqtr2d 2806 | 1 ⊢ (𝜑 → 𝐶 = (𝑀‘𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 382 = wceq 1631 ∈ wcel 2145 ∃!wreu 3063 ‘cfv 6031 ℩crio 6753 (class class class)co 6793 Basecbs 16064 distcds 16158 TarskiGcstrkg 25550 Itvcitv 25556 LineGclng 25557 pInvGcmir 25768 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4904 ax-sep 4915 ax-nul 4923 ax-pr 5034 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 835 df-3an 1073 df-tru 1634 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-nul 4064 df-if 4226 df-pw 4299 df-sn 4317 df-pr 4319 df-op 4323 df-uni 4575 df-iun 4656 df-br 4787 df-opab 4847 df-mpt 4864 df-id 5157 df-xp 5255 df-rel 5256 df-cnv 5257 df-co 5258 df-dm 5259 df-rn 5260 df-res 5261 df-ima 5262 df-iota 5994 df-fun 6033 df-fn 6034 df-f 6035 df-f1 6036 df-fo 6037 df-f1o 6038 df-fv 6039 df-riota 6754 df-ov 6796 df-trkgc 25568 df-trkgb 25569 df-trkgcb 25570 df-trkg 25573 df-mir 25769 |
This theorem is referenced by: mirmir 25778 mireq 25781 mirinv 25782 miriso 25786 mirmir2 25790 mirauto 25800 colmid 25804 krippenlem 25806 midexlem 25808 mideulem2 25847 opphllem 25848 midcom 25895 trgcopyeulem 25918 |
Copyright terms: Public domain | W3C validator |