lmiopp - Metamath Proof Explorer

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

Theorem lmiopp 27163

Description: Line mirroring produces points on the opposite side of the mirroring line. Theorem 10.14 of [Schwabhauser] p. 92. (Contributed by Thierry Arnoux, 2-Aug-2020.)

**Hypotheses**
Ref	Expression
lmiopp.p	⊢ 𝑃 = (Base‘𝐺)
lmiopp.m	⊢ − = (dist‘𝐺)
lmiopp.i	⊢ 𝐼 = (Itv‘𝐺)
lmiopp.l	⊢ 𝐿 = (LineG‘𝐺)
lmiopp.g	⊢ (𝜑 → 𝐺 ∈ TarskiG)
lmiopp.h	⊢ (𝜑 → 𝐺Dim_TarskiG≥2)
lmiopp.d	⊢ (𝜑 → 𝐷 ∈ ran 𝐿)
lmiopp.o	⊢ 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐷) ∧ 𝑏 ∈ (𝑃 ∖ 𝐷)) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
lmiopp.n	⊢ 𝑀 = ((lInvG‘𝐺)‘𝐷)
lmiopp.a	⊢ (𝜑 → 𝐴 ∈ 𝑃)
lmiopp.1	⊢ (𝜑 → ¬ 𝐴 ∈ 𝐷)

**Assertion**
Ref	Expression
lmiopp	⊢ (𝜑 → 𝐴𝑂(𝑀‘𝐴))

Distinct variable groups: − ,𝑎,𝑏,𝑡 𝐴,𝑎,𝑏,𝑡 𝐷,𝑎,𝑏,𝑡 𝐺,𝑎,𝑏,𝑡 𝐼,𝑎,𝑏,𝑡 𝑀,𝑎,𝑏,𝑡 𝑡,𝑂 𝑃,𝑎,𝑏,𝑡 𝜑,𝑎,𝑏,𝑡 Allowed substitution hints: 𝐿(𝑡,𝑎,𝑏) 𝑂(𝑎,𝑏)

**Proof of Theorem lmiopp**
Step	Hyp	Ref	Expression
1		lmiopp.p	. 2 ⊢ 𝑃 = (Base‘𝐺)
2		lmiopp.m	. 2 ⊢ − = (dist‘𝐺)
3		lmiopp.i	. 2 ⊢ 𝐼 = (Itv‘𝐺)
4		lmiopp.o	. 2 ⊢ 𝑂 = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ (𝑃 ∖ 𝐷) ∧ 𝑏 ∈ (𝑃 ∖ 𝐷)) ∧ ∃𝑡 ∈ 𝐷 𝑡 ∈ (𝑎𝐼𝑏))}
5		lmiopp.a	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃)
6		lmiopp.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ TarskiG)
7		lmiopp.h	. . 3 ⊢ (𝜑 → 𝐺Dim_TarskiG≥2)
8		lmiopp.n	. . 3 ⊢ 𝑀 = ((lInvG‘𝐺)‘𝐷)
9		lmiopp.l	. . 3 ⊢ 𝐿 = (LineG‘𝐺)
10		lmiopp.d	. . 3 ⊢ (𝜑 → 𝐷 ∈ ran 𝐿)
11	1, 2, 3, 6, 7, 8, 9, 10, 5	lmicl 27147	. 2 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑃)
12		eqidd 2739	. . . 4 ⊢ (𝜑 → (𝑀‘𝐴) = (𝑀‘𝐴))
13	1, 2, 3, 6, 7, 8, 9, 10, 5, 11	islmib 27148	. . . 4 ⊢ (𝜑 → ((𝑀‘𝐴) = (𝑀‘𝐴) ↔ ((𝐴(midG‘𝐺)(𝑀‘𝐴)) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿(𝑀‘𝐴)) ∨ 𝐴 = (𝑀‘𝐴)))))
14	12, 13	mpbid 231	. . 3 ⊢ (𝜑 → ((𝐴(midG‘𝐺)(𝑀‘𝐴)) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿(𝑀‘𝐴)) ∨ 𝐴 = (𝑀‘𝐴))))
15	14	simpld 495	. 2 ⊢ (𝜑 → (𝐴(midG‘𝐺)(𝑀‘𝐴)) ∈ 𝐷)
16		lmiopp.1	. 2 ⊢ (𝜑 → ¬ 𝐴 ∈ 𝐷)
17	1, 2, 3, 6, 7, 8, 9, 10, 5	lmilmi 27150	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑀‘𝐴)) = 𝐴)
18	17	eqeq1d 2740	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑀‘𝐴)) = (𝑀‘𝐴) ↔ 𝐴 = (𝑀‘𝐴)))
19	1, 2, 3, 6, 7, 8, 9, 10, 11	lmiinv 27153	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑀‘𝐴)) = (𝑀‘𝐴) ↔ (𝑀‘𝐴) ∈ 𝐷))
20		eqcom 2745	. . . . . 6 ⊢ (𝐴 = (𝑀‘𝐴) ↔ (𝑀‘𝐴) = 𝐴)
21	20	a1i 11	. . . . 5 ⊢ (𝜑 → (𝐴 = (𝑀‘𝐴) ↔ (𝑀‘𝐴) = 𝐴))
22	18, 19, 21	3bitr3d 309	. . . 4 ⊢ (𝜑 → ((𝑀‘𝐴) ∈ 𝐷 ↔ (𝑀‘𝐴) = 𝐴))
23	1, 2, 3, 6, 7, 8, 9, 10, 5	lmiinv 27153	. . . 4 ⊢ (𝜑 → ((𝑀‘𝐴) = 𝐴 ↔ 𝐴 ∈ 𝐷))
24	22, 23	bitrd 278	. . 3 ⊢ (𝜑 → ((𝑀‘𝐴) ∈ 𝐷 ↔ 𝐴 ∈ 𝐷))
25	16, 24	mtbird 325	. 2 ⊢ (𝜑 → ¬ (𝑀‘𝐴) ∈ 𝐷)
26	1, 2, 3, 6, 7, 5, 11	midbtwn 27140	. 2 ⊢ (𝜑 → (𝐴(midG‘𝐺)(𝑀‘𝐴)) ∈ (𝐴𝐼(𝑀‘𝐴)))
27	1, 2, 3, 4, 5, 11, 15, 16, 25, 26	islnoppd 27101	1 ⊢ (𝜑 → 𝐴𝑂(𝑀‘𝐴))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 844 = wceq 1539 ∈ wcel 2106 ∃wrex 3065 ∖ cdif 3884 class class class wbr 5074 {copab 5136 ran crn 5590 ‘cfv 6433 (class class class)co 7275 2c2 12028 Basecbs 16912 distcds 16971 TarskiGcstrkg 26788 Dim_TarskiG≥cstrkgld 26792 Itvcitv 26794 LineGclng 26795 ⟂Gcperpg 27056 midGcmid 27133 lInvGclmi 27134

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-oadd 8301 df-er 8498 df-map 8617 df-pm 8618 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-dju 9659 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-3 12037 df-n0 12234 df-xnn0 12306 df-z 12320 df-uz 12583 df-fz 13240 df-fzo 13383 df-hash 14045 df-word 14218 df-concat 14274 df-s1 14301 df-s2 14561 df-s3 14562 df-trkgc 26809 df-trkgb 26810 df-trkgcb 26811 df-trkgld 26813 df-trkg 26814 df-cgrg 26872 df-leg 26944 df-mir 27014 df-rag 27055 df-perpg 27057 df-mid 27135 df-lmi 27136

This theorem is referenced by: trgcopyeulem 27166

W3C validator