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 28774

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 28750	. . . . 5 ⊢ (𝜑 → 𝑀:𝑃⟶𝑃)
11		mirauto.1	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
12	10, 11	ffvelcdmd 7030	. . . 4 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑃)
13	7, 12	eqeltrid 2845	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝑃)
14		eqid 2741	. . 3 ⊢ (𝑆‘𝑋) = (𝑆‘𝑋)
15		mirauto.y	. . . 4 ⊢ 𝑌 = (𝑀‘𝐵)
16		mirauto.2	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃)
17	10, 16	ffvelcdmd 7030	. . . 4 ⊢ (𝜑 → (𝑀‘𝐵) ∈ 𝑃)
18	15, 17	eqeltrid 2845	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝑃)
19		mirauto.z	. . . 4 ⊢ 𝑍 = (𝑀‘𝐶)
20		mirauto.3	. . . . 5 ⊢ (𝜑 → 𝐶 ∈ 𝑃)
21	10, 20	ffvelcdmd 7030	. . . 4 ⊢ (𝜑 → (𝑀‘𝐶) ∈ 𝑃)
22	19, 21	eqeltrid 2845	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝑃)
23		mirauto.4	. . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) = 𝐶)
24	23, 20	eqeltrd 2841	. . . . 5 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) ∈ 𝑃)
25		eqid 2741	. . . . . 6 ⊢ (𝑆‘𝐴) = (𝑆‘𝐴)
26	1, 2, 3, 4, 5, 6, 11, 25, 16	mircgr 28747	. . . . 5 ⊢ (𝜑 → (𝐴 − ((𝑆‘𝐴)‘𝐵)) = (𝐴 − 𝐵))
27	1, 2, 3, 4, 5, 6, 8, 9, 11, 24, 11, 16, 26	mircgrs 28763	. . . 4 ⊢ (𝜑 → ((𝑀‘𝐴) − (𝑀‘((𝑆‘𝐴)‘𝐵))) = ((𝑀‘𝐴) − (𝑀‘𝐵)))
28	7	a1i 11	. . . . 5 ⊢ (𝜑 → 𝑋 = (𝑀‘𝐴))
29	23	fveq2d 6835	. . . . . 6 ⊢ (𝜑 → (𝑀‘((𝑆‘𝐴)‘𝐵)) = (𝑀‘𝐶))
30	19, 29	eqtr4id 2795	. . . . 5 ⊢ (𝜑 → 𝑍 = (𝑀‘((𝑆‘𝐴)‘𝐵)))
31	28, 30	oveq12d 7378	. . . 4 ⊢ (𝜑 → (𝑋 − 𝑍) = ((𝑀‘𝐴) − (𝑀‘((𝑆‘𝐴)‘𝐵))))
32	7, 15	oveq12i 7372	. . . . 5 ⊢ (𝑋 − 𝑌) = ((𝑀‘𝐴) − (𝑀‘𝐵))
33	32	a1i 11	. . . 4 ⊢ (𝜑 → (𝑋 − 𝑌) = ((𝑀‘𝐴) − (𝑀‘𝐵)))
34	27, 31, 33	3eqtr4d 2786	. . 3 ⊢ (𝜑 → (𝑋 − 𝑍) = (𝑋 − 𝑌))
35	1, 2, 3, 4, 5, 6, 11, 25, 16	mirbtwn 28748	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ (((𝑆‘𝐴)‘𝐵)𝐼𝐵))
36	23	oveq1d 7375	. . . . . 6 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝐵)𝐼𝐵) = (𝐶𝐼𝐵))
37	35, 36	eleqtrd 2843	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ (𝐶𝐼𝐵))
38	1, 2, 3, 4, 5, 6, 8, 9, 20, 11, 16, 37	mirbtwni 28761	. . . 4 ⊢ (𝜑 → (𝑀‘𝐴) ∈ ((𝑀‘𝐶)𝐼(𝑀‘𝐵)))
39	19, 15	oveq12i 7372	. . . 4 ⊢ (𝑍𝐼𝑌) = ((𝑀‘𝐶)𝐼(𝑀‘𝐵))
40	38, 7, 39	3eltr4g 2858	. . 3 ⊢ (𝜑 → 𝑋 ∈ (𝑍𝐼𝑌))
41	1, 2, 3, 4, 5, 6, 13, 14, 18, 22, 34, 40	ismir 28749	. 2 ⊢ (𝜑 → 𝑍 = ((𝑆‘𝑋)‘𝑌))
42	41	eqcomd 2747	1 ⊢ (𝜑 → ((𝑆‘𝑋)‘𝑌) = 𝑍)

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1548 ∈ wcel 2121 ‘cfv 6489 (class class class)co 7360 Basecbs 17174 distcds 17224 TarskiGcstrkg 28517 Itvcitv 28523 LineGclng 28524 pInvGcmir 28742

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 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5202 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110

This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4842 df-int 4881 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-oadd 8403 df-er 8637 df-pm 8770 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-dju 9820 df-card 9858 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-2 12239 df-3 12240 df-n0 12433 df-xnn0 12506 df-z 12520 df-uz 12784 df-fz 13457 df-fzo 13604 df-hash 14288 df-word 14471 df-concat 14528 df-s1 14554 df-s2 14805 df-s3 14806 df-trkgc 28538 df-trkgb 28539 df-trkgcb 28540 df-trkg 28543 df-cgrg 28601 df-mir 28743

This theorem is referenced by: miduniq2 28777 krippenlem 28780

W3C validator