![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > mirreu | Structured version Visualization version GIF version |
Description: Any point has a unique antecedent through point inversion. Theorem 7.8 of [Schwabhauser] p. 50. (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 | ⊢ 𝑀 = (𝑆‘𝐴) |
mirmir.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
Ref | Expression |
---|---|
mirreu | ⊢ (𝜑 → ∃!𝑎 ∈ 𝑃 (𝑀‘𝑎) = 𝐵) |
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 | mirmir.b | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
10 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | mircl 25356 | . 2 ⊢ (𝜑 → (𝑀‘𝐵) ∈ 𝑃) |
11 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | mirmir 25357 | . 2 ⊢ (𝜑 → (𝑀‘(𝑀‘𝐵)) = 𝐵) |
12 | 6 | ad2antrr 758 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑃) ∧ (𝑀‘𝑎) = 𝐵) → 𝐺 ∈ TarskiG) |
13 | 7 | ad2antrr 758 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑃) ∧ (𝑀‘𝑎) = 𝐵) → 𝐴 ∈ 𝑃) |
14 | simplr 788 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑃) ∧ (𝑀‘𝑎) = 𝐵) → 𝑎 ∈ 𝑃) | |
15 | 1, 2, 3, 4, 5, 12, 13, 8, 14 | mirmir 25357 | . . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑃) ∧ (𝑀‘𝑎) = 𝐵) → (𝑀‘(𝑀‘𝑎)) = 𝑎) |
16 | simpr 476 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑃) ∧ (𝑀‘𝑎) = 𝐵) → (𝑀‘𝑎) = 𝐵) | |
17 | 16 | fveq2d 6107 | . . . . 5 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑃) ∧ (𝑀‘𝑎) = 𝐵) → (𝑀‘(𝑀‘𝑎)) = (𝑀‘𝐵)) |
18 | 15, 17 | eqtr3d 2646 | . . . 4 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑃) ∧ (𝑀‘𝑎) = 𝐵) → 𝑎 = (𝑀‘𝐵)) |
19 | 18 | ex 449 | . . 3 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → ((𝑀‘𝑎) = 𝐵 → 𝑎 = (𝑀‘𝐵))) |
20 | 19 | ralrimiva 2949 | . 2 ⊢ (𝜑 → ∀𝑎 ∈ 𝑃 ((𝑀‘𝑎) = 𝐵 → 𝑎 = (𝑀‘𝐵))) |
21 | fveq2 6103 | . . . 4 ⊢ (𝑎 = (𝑀‘𝐵) → (𝑀‘𝑎) = (𝑀‘(𝑀‘𝐵))) | |
22 | 21 | eqeq1d 2612 | . . 3 ⊢ (𝑎 = (𝑀‘𝐵) → ((𝑀‘𝑎) = 𝐵 ↔ (𝑀‘(𝑀‘𝐵)) = 𝐵)) |
23 | 22 | eqreu 3365 | . 2 ⊢ (((𝑀‘𝐵) ∈ 𝑃 ∧ (𝑀‘(𝑀‘𝐵)) = 𝐵 ∧ ∀𝑎 ∈ 𝑃 ((𝑀‘𝑎) = 𝐵 → 𝑎 = (𝑀‘𝐵))) → ∃!𝑎 ∈ 𝑃 (𝑀‘𝑎) = 𝐵) |
24 | 10, 11, 20, 23 | syl3anc 1318 | 1 ⊢ (𝜑 → ∃!𝑎 ∈ 𝑃 (𝑀‘𝑎) = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∀wral 2896 ∃!wreu 2898 ‘cfv 5804 Basecbs 15695 distcds 15777 TarskiGcstrkg 25129 Itvcitv 25135 LineGclng 25136 pInvGcmir 25347 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-trkgc 25147 df-trkgb 25148 df-trkgcb 25149 df-trkg 25152 df-mir 25348 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |