Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mirauto | Structured version Visualization version GIF version |
Description: Point inversion preserves point inversion. (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) |
mirauto.m | ⊢ 𝑀 = (𝑆‘𝑇) |
mirauto.x | ⊢ 𝑋 = (𝑀‘𝐴) |
mirauto.y | ⊢ 𝑌 = (𝑀‘𝐵) |
mirauto.z | ⊢ 𝑍 = (𝑀‘𝐶) |
mirauto.0 | ⊢ (𝜑 → 𝑇 ∈ 𝑃) |
mirauto.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
mirauto.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
mirauto.3 | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
mirauto.4 | ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) = 𝐶) |
Ref | Expression |
---|---|
mirauto | ⊢ (𝜑 → ((𝑆‘𝑋)‘𝑌) = 𝑍) |
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 | mirauto.x | . . . 4 ⊢ 𝑋 = (𝑀‘𝐴) | |
8 | mirauto.0 | . . . . . 6 ⊢ (𝜑 → 𝑇 ∈ 𝑃) | |
9 | mirauto.m | . . . . . 6 ⊢ 𝑀 = (𝑆‘𝑇) | |
10 | 1, 2, 3, 4, 5, 6, 8, 9 | mirf 25555 | . . . . 5 ⊢ (𝜑 → 𝑀:𝑃⟶𝑃) |
11 | mirauto.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
12 | 10, 11 | ffvelrnd 6360 | . . . 4 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑃) |
13 | 7, 12 | syl5eqel 2705 | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
14 | eqid 2622 | . . 3 ⊢ (𝑆‘𝑋) = (𝑆‘𝑋) | |
15 | mirauto.y | . . . 4 ⊢ 𝑌 = (𝑀‘𝐵) | |
16 | mirauto.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
17 | 10, 16 | ffvelrnd 6360 | . . . 4 ⊢ (𝜑 → (𝑀‘𝐵) ∈ 𝑃) |
18 | 15, 17 | syl5eqel 2705 | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
19 | mirauto.z | . . . 4 ⊢ 𝑍 = (𝑀‘𝐶) | |
20 | mirauto.3 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
21 | 10, 20 | ffvelrnd 6360 | . . . 4 ⊢ (𝜑 → (𝑀‘𝐶) ∈ 𝑃) |
22 | 19, 21 | syl5eqel 2705 | . . 3 ⊢ (𝜑 → 𝑍 ∈ 𝑃) |
23 | mirauto.4 | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) = 𝐶) | |
24 | 23, 20 | eqeltrd 2701 | . . . . 5 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) ∈ 𝑃) |
25 | eqid 2622 | . . . . . 6 ⊢ (𝑆‘𝐴) = (𝑆‘𝐴) | |
26 | 1, 2, 3, 4, 5, 6, 11, 25, 16 | mircgr 25552 | . . . . 5 ⊢ (𝜑 → (𝐴 − ((𝑆‘𝐴)‘𝐵)) = (𝐴 − 𝐵)) |
27 | 1, 2, 3, 4, 5, 6, 8, 9, 11, 24, 11, 16, 26 | mircgrs 25568 | . . . 4 ⊢ (𝜑 → ((𝑀‘𝐴) − (𝑀‘((𝑆‘𝐴)‘𝐵))) = ((𝑀‘𝐴) − (𝑀‘𝐵))) |
28 | 7 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝑋 = (𝑀‘𝐴)) |
29 | 23 | fveq2d 6195 | . . . . . 6 ⊢ (𝜑 → (𝑀‘((𝑆‘𝐴)‘𝐵)) = (𝑀‘𝐶)) |
30 | 29, 19 | syl6reqr 2675 | . . . . 5 ⊢ (𝜑 → 𝑍 = (𝑀‘((𝑆‘𝐴)‘𝐵))) |
31 | 28, 30 | oveq12d 6668 | . . . 4 ⊢ (𝜑 → (𝑋 − 𝑍) = ((𝑀‘𝐴) − (𝑀‘((𝑆‘𝐴)‘𝐵)))) |
32 | 7, 15 | oveq12i 6662 | . . . . 5 ⊢ (𝑋 − 𝑌) = ((𝑀‘𝐴) − (𝑀‘𝐵)) |
33 | 32 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝑋 − 𝑌) = ((𝑀‘𝐴) − (𝑀‘𝐵))) |
34 | 27, 31, 33 | 3eqtr4d 2666 | . . 3 ⊢ (𝜑 → (𝑋 − 𝑍) = (𝑋 − 𝑌)) |
35 | 1, 2, 3, 4, 5, 6, 11, 25, 16 | mirbtwn 25553 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (((𝑆‘𝐴)‘𝐵)𝐼𝐵)) |
36 | 23 | oveq1d 6665 | . . . . . 6 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝐵)𝐼𝐵) = (𝐶𝐼𝐵)) |
37 | 35, 36 | eleqtrd 2703 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ (𝐶𝐼𝐵)) |
38 | 1, 2, 3, 4, 5, 6, 8, 9, 20, 11, 16, 37 | mirbtwni 25566 | . . . 4 ⊢ (𝜑 → (𝑀‘𝐴) ∈ ((𝑀‘𝐶)𝐼(𝑀‘𝐵))) |
39 | 19, 15 | oveq12i 6662 | . . . 4 ⊢ (𝑍𝐼𝑌) = ((𝑀‘𝐶)𝐼(𝑀‘𝐵)) |
40 | 38, 7, 39 | 3eltr4g 2718 | . . 3 ⊢ (𝜑 → 𝑋 ∈ (𝑍𝐼𝑌)) |
41 | 1, 2, 3, 4, 5, 6, 13, 14, 18, 22, 34, 40 | ismir 25554 | . 2 ⊢ (𝜑 → 𝑍 = ((𝑆‘𝑋)‘𝑌)) |
42 | 41 | eqcomd 2628 | 1 ⊢ (𝜑 → ((𝑆‘𝑋)‘𝑌) = 𝑍) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1483 ∈ wcel 1990 ‘cfv 5888 (class class class)co 6650 Basecbs 15857 distcds 15950 TarskiGcstrkg 25329 Itvcitv 25335 LineGclng 25336 pInvGcmir 25547 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-pm 7860 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-xnn0 11364 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-hash 13118 df-word 13299 df-concat 13301 df-s1 13302 df-s2 13593 df-s3 13594 df-trkgc 25347 df-trkgb 25348 df-trkgcb 25349 df-trkg 25352 df-cgrg 25406 df-mir 25548 |
This theorem is referenced by: miduniq2 25582 krippenlem 25585 |
Copyright terms: Public domain | W3C validator |