| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mirmir2 | Structured version Visualization version GIF version | ||
| Description: Point inversion of a point inversion through another point. (Contributed by Thierry Arnoux, 3-Nov-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 | ⊢ 𝑀 = (𝑆‘𝐴) |
| miriso.1 | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
| miriso.2 | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
| Ref | Expression |
|---|---|
| mirmir2 | ⊢ (𝜑 → (𝑀‘((𝑆‘𝑌)‘𝑋)) = ((𝑆‘(𝑀‘𝑌))‘(𝑀‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mirval.p | . 2 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | mirval.d | . 2 ⊢ − = (dist‘𝐺) | |
| 3 | mirval.i | . 2 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | mirval.l | . 2 ⊢ 𝐿 = (LineG‘𝐺) | |
| 5 | mirval.s | . 2 ⊢ 𝑆 = (pInvG‘𝐺) | |
| 6 | mirval.g | . 2 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 7 | mirval.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 8 | mirfv.m | . . 3 ⊢ 𝑀 = (𝑆‘𝐴) | |
| 9 | miriso.2 | . . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 10 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | mircl 28682 | . 2 ⊢ (𝜑 → (𝑀‘𝑌) ∈ 𝑃) |
| 11 | eqid 2734 | . 2 ⊢ (𝑆‘(𝑀‘𝑌)) = (𝑆‘(𝑀‘𝑌)) | |
| 12 | miriso.1 | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 13 | 1, 2, 3, 4, 5, 6, 7, 8, 12 | mircl 28682 | . 2 ⊢ (𝜑 → (𝑀‘𝑋) ∈ 𝑃) |
| 14 | eqid 2734 | . . . 4 ⊢ (𝑆‘𝑌) = (𝑆‘𝑌) | |
| 15 | 1, 2, 3, 4, 5, 6, 9, 14, 12 | mircl 28682 | . . 3 ⊢ (𝜑 → ((𝑆‘𝑌)‘𝑋) ∈ 𝑃) |
| 16 | 1, 2, 3, 4, 5, 6, 7, 8, 15 | mircl 28682 | . 2 ⊢ (𝜑 → (𝑀‘((𝑆‘𝑌)‘𝑋)) ∈ 𝑃) |
| 17 | 1, 2, 3, 4, 5, 6, 9, 14, 12 | mircgr 28678 | . . 3 ⊢ (𝜑 → (𝑌 − ((𝑆‘𝑌)‘𝑋)) = (𝑌 − 𝑋)) |
| 18 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 15, 9, 12, 17 | mircgrs 28694 | . 2 ⊢ (𝜑 → ((𝑀‘𝑌) − (𝑀‘((𝑆‘𝑌)‘𝑋))) = ((𝑀‘𝑌) − (𝑀‘𝑋))) |
| 19 | 1, 2, 3, 4, 5, 6, 9, 14, 12 | mirbtwn 28679 | . . 3 ⊢ (𝜑 → 𝑌 ∈ (((𝑆‘𝑌)‘𝑋)𝐼𝑋)) |
| 20 | 1, 2, 3, 4, 5, 6, 7, 8, 15, 9, 12, 19 | mirbtwni 28692 | . 2 ⊢ (𝜑 → (𝑀‘𝑌) ∈ ((𝑀‘((𝑆‘𝑌)‘𝑋))𝐼(𝑀‘𝑋))) |
| 21 | 1, 2, 3, 4, 5, 6, 10, 11, 13, 16, 18, 20 | ismir 28680 | 1 ⊢ (𝜑 → (𝑀‘((𝑆‘𝑌)‘𝑋)) = ((𝑆‘(𝑀‘𝑌))‘(𝑀‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 ‘cfv 6490 Basecbs 17134 distcds 17184 TarskiGcstrkg 28448 Itvcitv 28454 LineGclng 28455 pInvGcmir 28673 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-tp 4583 df-op 4585 df-uni 4862 df-int 4901 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-oadd 8399 df-er 8633 df-pm 8764 df-en 8882 df-dom 8883 df-sdom 8884 df-fin 8885 df-dju 9811 df-card 9849 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-nn 12144 df-2 12206 df-3 12207 df-n0 12400 df-xnn0 12473 df-z 12487 df-uz 12750 df-fz 13422 df-fzo 13569 df-hash 14252 df-word 14435 df-concat 14492 df-s1 14518 df-s2 14769 df-s3 14770 df-trkgc 28469 df-trkgb 28470 df-trkgcb 28471 df-trkg 28474 df-cgrg 28532 df-mir 28674 |
| This theorem is referenced by: mirrag 28722 colperpexlem1 28751 mirmid 28804 |
| Copyright terms: Public domain | W3C validator |