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 28825

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 28809	. 2 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑃)
12		eqidd 2736	. . . 4 ⊢ (𝜑 → (𝑀‘𝐴) = (𝑀‘𝐴))
13	1, 2, 3, 6, 7, 8, 9, 10, 5, 11	islmib 28810	. . . 4 ⊢ (𝜑 → ((𝑀‘𝐴) = (𝑀‘𝐴) ↔ ((𝐴(midG‘𝐺)(𝑀‘𝐴)) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿(𝑀‘𝐴)) ∨ 𝐴 = (𝑀‘𝐴)))))
14	12, 13	mpbid 232	. . 3 ⊢ (𝜑 → ((𝐴(midG‘𝐺)(𝑀‘𝐴)) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿(𝑀‘𝐴)) ∨ 𝐴 = (𝑀‘𝐴))))
15	14	simpld 494	. 2 ⊢ (𝜑 → (𝐴(midG‘𝐺)(𝑀‘𝐴)) ∈ 𝐷)
16		lmiopp.1	. 2 ⊢ (𝜑 → ¬ 𝐴 ∈ 𝐷)
17	1, 2, 3, 6, 7, 8, 9, 10, 5	lmilmi 28812	. . . . . 6 ⊢ (𝜑 → (𝑀‘(𝑀‘𝐴)) = 𝐴)
18	17	eqeq1d 2737	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑀‘𝐴)) = (𝑀‘𝐴) ↔ 𝐴 = (𝑀‘𝐴)))
19	1, 2, 3, 6, 7, 8, 9, 10, 11	lmiinv 28815	. . . . 5 ⊢ (𝜑 → ((𝑀‘(𝑀‘𝐴)) = (𝑀‘𝐴) ↔ (𝑀‘𝐴) ∈ 𝐷))
20		eqcom 2742	. . . . . 6 ⊢ (𝐴 = (𝑀‘𝐴) ↔ (𝑀‘𝐴) = 𝐴)
21	20	a1i 11	. . . . 5 ⊢ (𝜑 → (𝐴 = (𝑀‘𝐴) ↔ (𝑀‘𝐴) = 𝐴))
22	18, 19, 21	3bitr3d 309	. . . 4 ⊢ (𝜑 → ((𝑀‘𝐴) ∈ 𝐷 ↔ (𝑀‘𝐴) = 𝐴))
23	1, 2, 3, 6, 7, 8, 9, 10, 5	lmiinv 28815	. . . 4 ⊢ (𝜑 → ((𝑀‘𝐴) = 𝐴 ↔ 𝐴 ∈ 𝐷))
24	22, 23	bitrd 279	. . 3 ⊢ (𝜑 → ((𝑀‘𝐴) ∈ 𝐷 ↔ 𝐴 ∈ 𝐷))
25	16, 24	mtbird 325	. 2 ⊢ (𝜑 → ¬ (𝑀‘𝐴) ∈ 𝐷)
26	1, 2, 3, 6, 7, 5, 11	midbtwn 28802	. 2 ⊢ (𝜑 → (𝐴(midG‘𝐺)(𝑀‘𝐴)) ∈ (𝐴𝐼(𝑀‘𝐴)))
27	1, 2, 3, 4, 5, 11, 15, 16, 25, 26	islnoppd 28763	1 ⊢ (𝜑 → 𝐴𝑂(𝑀‘𝐴))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1537 ∈ wcel 2106 ∃wrex 3068 ∖ cdif 3960 class class class wbr 5148 {copab 5210 ran crn 5690 ‘cfv 6563 (class class class)co 7431 2c2 12319 Basecbs 17245 distcds 17307 TarskiGcstrkg 28450 Dim_TarskiG≥cstrkgld 28454 Itvcitv 28456 LineGclng 28457 ⟂Gcperpg 28718 midGcmid 28795 lInvGclmi 28796

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-tp 4636 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-oadd 8509 df-er 8744 df-map 8867 df-pm 8868 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-dju 9939 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-3 12328 df-n0 12525 df-xnn0 12598 df-z 12612 df-uz 12877 df-fz 13545 df-fzo 13692 df-hash 14367 df-word 14550 df-concat 14606 df-s1 14631 df-s2 14884 df-s3 14885 df-trkgc 28471 df-trkgb 28472 df-trkgcb 28473 df-trkgld 28475 df-trkg 28476 df-cgrg 28534 df-leg 28606 df-mir 28676 df-rag 28717 df-perpg 28719 df-mid 28797 df-lmi 28798

This theorem is referenced by: trgcopyeulem 28828

W3C validator