| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mirf | Structured version Visualization version GIF version | ||
| Description: Point inversion as function. (Contributed by Thierry Arnoux, 30-May-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 | ⊢ 𝑀 = (𝑆‘𝐴) |
| Ref | Expression |
|---|---|
| mirf | ⊢ (𝜑 → 𝑀:𝑃⟶𝑃) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | riotaex 7373 | . . 3 ⊢ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦))) ∈ V | |
| 2 | 1 | a1i 11 | . 2 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑃) → (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦))) ∈ V) |
| 3 | mirfv.m | . . 3 ⊢ 𝑀 = (𝑆‘𝐴) | |
| 4 | mirval.p | . . . 4 ⊢ 𝑃 = (Base‘𝐺) | |
| 5 | mirval.d | . . . 4 ⊢ − = (dist‘𝐺) | |
| 6 | mirval.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
| 7 | mirval.l | . . . 4 ⊢ 𝐿 = (LineG‘𝐺) | |
| 8 | mirval.s | . . . 4 ⊢ 𝑆 = (pInvG‘𝐺) | |
| 9 | mirval.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 10 | mirval.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 11 | 4, 5, 6, 7, 8, 9, 10 | mirval 28910 | . . 3 ⊢ (𝜑 → (𝑆‘𝐴) = (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦))))) |
| 12 | 3, 11 | eqtrid 2810 | . 2 ⊢ (𝜑 → 𝑀 = (𝑦 ∈ 𝑃 ↦ (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑦) ∧ 𝐴 ∈ (𝑧𝐼𝑦))))) |
| 13 | 9 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑃) → 𝐺 ∈ TarskiG) |
| 14 | 10 | adantr 485 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑃) → 𝐴 ∈ 𝑃) |
| 15 | simpr 489 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑃) → 𝑥 ∈ 𝑃) | |
| 16 | 4, 5, 6, 7, 8, 13, 14, 3, 15 | mirfv 28911 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑃) → (𝑀‘𝑥) = (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑥) ∧ 𝐴 ∈ (𝑧𝐼𝑥)))) |
| 17 | 4, 5, 6, 13, 15, 14 | mirreu3 28909 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑃) → ∃!𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑥) ∧ 𝐴 ∈ (𝑧𝐼𝑥))) |
| 18 | riotacl 7386 | . . . 4 ⊢ (∃!𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑥) ∧ 𝐴 ∈ (𝑧𝐼𝑥)) → (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑥) ∧ 𝐴 ∈ (𝑧𝐼𝑥))) ∈ 𝑃) | |
| 19 | 17, 18 | syl 18 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑃) → (℩𝑧 ∈ 𝑃 ((𝐴 − 𝑧) = (𝐴 − 𝑥) ∧ 𝐴 ∈ (𝑧𝐼𝑥))) ∈ 𝑃) |
| 20 | 16, 19 | eqeltrd 2863 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑃) → (𝑀‘𝑥) ∈ 𝑃) |
| 21 | 2, 12, 20 | fmpt2d 7122 | 1 ⊢ (𝜑 → 𝑀:𝑃⟶𝑃) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∃!wreu 3367 Vcvv 3455 ↦ cmpt 5193 ⟶wf 6534 ‘cfv 6538 ℩crio 7368 (class class class)co 7412 Basecbs 17270 distcds 17320 TarskiGcstrkg 28674 Itvcitv 28680 LineGclng 28681 pInvGcmir 28907 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-trkgc 28695 df-trkgb 28696 df-trkgcb 28697 df-trkg 28700 df-mir 28908 |
| This theorem is referenced by: mircl 28916 mirf1o 28924 mirbtwni 28926 mirbtwnb 28927 mirauto 28939 miduniq2 28942 krippenlem 28945 |
| Copyright terms: Public domain | W3C validator |