mirauto - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > mirauto		Structured version Visualization version GIF version

Theorem mirauto 26729

Description: Point inversion preserves point inversion. (Contributed by Thierry Arnoux, 30-Jul-2019.)

**Hypotheses**
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	⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) = 𝐶)

**Assertion**
Ref	Expression
mirauto	⊢ (𝜑 → ((𝑆‘𝑋)‘𝑌) = 𝑍)

**Proof of Theorem 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 26705	. . . . 5 ⊢ (𝜑 → 𝑀:𝑃⟶𝑃)
11		mirauto.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
12	10, 11	ffvelrnd 6883	. . . 4 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑃)
13	7, 12	eqeltrid 2835	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑃)
14		eqid 2736	. . 3 ⊢ (𝑆‘𝑋) = (𝑆‘𝑋)
15		mirauto.y	. . . 4 ⊢ 𝑌 = (𝑀‘𝐵)
16		mirauto.2	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
17	10, 16	ffvelrnd 6883	. . . 4 ⊢ (𝜑 → (𝑀‘𝐵) ∈ 𝑃)
18	15, 17	eqeltrid 2835	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑃)
19		mirauto.z	. . . 4 ⊢ 𝑍 = (𝑀‘𝐶)
20		mirauto.3	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
21	10, 20	ffvelrnd 6883	. . . 4 ⊢ (𝜑 → (𝑀‘𝐶) ∈ 𝑃)
22	19, 21	eqeltrid 2835	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝑃)
23		mirauto.4	. . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) = 𝐶)
24	23, 20	eqeltrd 2831	. . . . 5 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) ∈ 𝑃)
25		eqid 2736	. . . . . 6 ⊢ (𝑆‘𝐴) = (𝑆‘𝐴)
26	1, 2, 3, 4, 5, 6, 11, 25, 16	mircgr 26702	. . . . 5 ⊢ (𝜑 → (𝐴 − ((𝑆‘𝐴)‘𝐵)) = (𝐴 − 𝐵))
27	1, 2, 3, 4, 5, 6, 8, 9, 11, 24, 11, 16, 26	mircgrs 26718	. . . 4 ⊢ (𝜑 → ((𝑀‘𝐴) − (𝑀‘((𝑆‘𝐴)‘𝐵))) = ((𝑀‘𝐴) − (𝑀‘𝐵)))
28	7	a1i 11	. . . . 5 ⊢ (𝜑 → 𝑋 = (𝑀‘𝐴))
29	23	fveq2d 6699	. . . . . 6 ⊢ (𝜑 → (𝑀‘((𝑆‘𝐴)‘𝐵)) = (𝑀‘𝐶))
30	19, 29	eqtr4id 2790	. . . . 5 ⊢ (𝜑 → 𝑍 = (𝑀‘((𝑆‘𝐴)‘𝐵)))
31	28, 30	oveq12d 7209	. . . 4 ⊢ (𝜑 → (𝑋 − 𝑍) = ((𝑀‘𝐴) − (𝑀‘((𝑆‘𝐴)‘𝐵))))
32	7, 15	oveq12i 7203	. . . . 5 ⊢ (𝑋 − 𝑌) = ((𝑀‘𝐴) − (𝑀‘𝐵))
33	32	a1i 11	. . . 4 ⊢ (𝜑 → (𝑋 − 𝑌) = ((𝑀‘𝐴) − (𝑀‘𝐵)))
34	27, 31, 33	3eqtr4d 2781	. . 3 ⊢ (𝜑 → (𝑋 − 𝑍) = (𝑋 − 𝑌))
35	1, 2, 3, 4, 5, 6, 11, 25, 16	mirbtwn 26703	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (((𝑆‘𝐴)‘𝐵)𝐼𝐵))
36	23	oveq1d 7206	. . . . . 6 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝐵)𝐼𝐵) = (𝐶𝐼𝐵))
37	35, 36	eleqtrd 2833	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ (𝐶𝐼𝐵))
38	1, 2, 3, 4, 5, 6, 8, 9, 20, 11, 16, 37	mirbtwni 26716	. . . 4 ⊢ (𝜑 → (𝑀‘𝐴) ∈ ((𝑀‘𝐶)𝐼(𝑀‘𝐵)))
39	19, 15	oveq12i 7203	. . . 4 ⊢ (𝑍𝐼𝑌) = ((𝑀‘𝐶)𝐼(𝑀‘𝐵))
40	38, 7, 39	3eltr4g 2848	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝑍𝐼𝑌))
41	1, 2, 3, 4, 5, 6, 13, 14, 18, 22, 34, 40	ismir 26704	. 2 ⊢ (𝜑 → 𝑍 = ((𝑆‘𝑋)‘𝑌))
42	41	eqcomd 2742	1 ⊢ (𝜑 → ((𝑆‘𝑋)‘𝑌) = 𝑍)

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1543 ∈ wcel 2112 ‘cfv 6358 (class class class)co 7191 Basecbs 16666 distcds 16758 TarskiGcstrkg 26475 Itvcitv 26481 LineGclng 26482 pInvGcmir 26697

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-rep 5164 ax-sep 5177 ax-nul 5184 ax-pow 5243 ax-pr 5307 ax-un 7501 ax-cnex 10750 ax-resscn 10751 ax-1cn 10752 ax-icn 10753 ax-addcl 10754 ax-addrcl 10755 ax-mulcl 10756 ax-mulrcl 10757 ax-mulcom 10758 ax-addass 10759 ax-mulass 10760 ax-distr 10761 ax-i2m1 10762 ax-1ne0 10763 ax-1rid 10764 ax-rnegex 10765 ax-rrecex 10766 ax-cnre 10767 ax-pre-lttri 10768 ax-pre-lttrn 10769 ax-pre-ltadd 10770 ax-pre-mulgt0 10771

This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3or 1090 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-nel 3037 df-ral 3056 df-rex 3057 df-reu 3058 df-rmo 3059 df-rab 3060 df-v 3400 df-sbc 3684 df-csb 3799 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-pss 3872 df-nul 4224 df-if 4426 df-pw 4501 df-sn 4528 df-pr 4530 df-tp 4532 df-op 4534 df-uni 4806 df-int 4846 df-iun 4892 df-br 5040 df-opab 5102 df-mpt 5121 df-tr 5147 df-id 5440 df-eprel 5445 df-po 5453 df-so 5454 df-fr 5494 df-we 5496 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-pred 6140 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6316 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7148 df-ov 7194 df-oprab 7195 df-mpo 7196 df-om 7623 df-1st 7739 df-2nd 7740 df-wrecs 8025 df-recs 8086 df-rdg 8124 df-1o 8180 df-oadd 8184 df-er 8369 df-pm 8489 df-en 8605 df-dom 8606 df-sdom 8607 df-fin 8608 df-dju 9482 df-card 9520 df-pnf 10834 df-mnf 10835 df-xr 10836 df-ltxr 10837 df-le 10838 df-sub 11029 df-neg 11030 df-nn 11796 df-2 11858 df-3 11859 df-n0 12056 df-xnn0 12128 df-z 12142 df-uz 12404 df-fz 13061 df-fzo 13204 df-hash 13862 df-word 14035 df-concat 14091 df-s1 14118 df-s2 14378 df-s3 14379 df-trkgc 26493 df-trkgb 26494 df-trkgcb 26495 df-trkg 26498 df-cgrg 26556 df-mir 26698

This theorem is referenced by: miduniq2 26732 krippenlem 26735

W3C validator