| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lmicom | Structured version Visualization version GIF version | ||
| Description: The line mirroring function is an involution. Theorem 10.4 of [Schwabhauser] p. 89. (Contributed by Thierry Arnoux, 11-Dec-2019.) |
| Ref | Expression |
|---|---|
| ismid.p | ⊢ 𝑃 = (Base‘𝐺) |
| ismid.d | ⊢ − = (dist‘𝐺) |
| ismid.i | ⊢ 𝐼 = (Itv‘𝐺) |
| ismid.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| ismid.1 | ⊢ (𝜑 → 𝐺DimTarskiG≥2) |
| lmif.m | ⊢ 𝑀 = ((lInvG‘𝐺)‘𝐷) |
| lmif.l | ⊢ 𝐿 = (LineG‘𝐺) |
| lmif.d | ⊢ (𝜑 → 𝐷 ∈ ran 𝐿) |
| lmicl.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| islmib.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| lmicom.1 | ⊢ (𝜑 → (𝑀‘𝐴) = 𝐵) |
| Ref | Expression |
|---|---|
| lmicom | ⊢ (𝜑 → (𝑀‘𝐵) = 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ismid.p | . . . . 5 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | ismid.d | . . . . 5 ⊢ − = (dist‘𝐺) | |
| 3 | ismid.i | . . . . 5 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | ismid.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | ismid.1 | . . . . 5 ⊢ (𝜑 → 𝐺DimTarskiG≥2) | |
| 6 | lmicl.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 7 | islmib.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | midcom 29091 | . . . 4 ⊢ (𝜑 → (𝐴(midG‘𝐺)𝐵) = (𝐵(midG‘𝐺)𝐴)) |
| 9 | lmicom.1 | . . . . . . 7 ⊢ (𝜑 → (𝑀‘𝐴) = 𝐵) | |
| 10 | 9 | eqcomd 2769 | . . . . . 6 ⊢ (𝜑 → 𝐵 = (𝑀‘𝐴)) |
| 11 | lmif.m | . . . . . . 7 ⊢ 𝑀 = ((lInvG‘𝐺)‘𝐷) | |
| 12 | lmif.l | . . . . . . 7 ⊢ 𝐿 = (LineG‘𝐺) | |
| 13 | lmif.d | . . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ ran 𝐿) | |
| 14 | 1, 2, 3, 4, 5, 11, 12, 13, 6, 7 | islmib 29096 | . . . . . 6 ⊢ (𝜑 → (𝐵 = (𝑀‘𝐴) ↔ ((𝐴(midG‘𝐺)𝐵) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ∨ 𝐴 = 𝐵)))) |
| 15 | 10, 14 | mpbid 235 | . . . . 5 ⊢ (𝜑 → ((𝐴(midG‘𝐺)𝐵) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ∨ 𝐴 = 𝐵))) |
| 16 | 15 | simpld 499 | . . . 4 ⊢ (𝜑 → (𝐴(midG‘𝐺)𝐵) ∈ 𝐷) |
| 17 | 8, 16 | eqeltrrd 2864 | . . 3 ⊢ (𝜑 → (𝐵(midG‘𝐺)𝐴) ∈ 𝐷) |
| 18 | 15 | simprd 500 | . . . . . . . . 9 ⊢ (𝜑 → (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ∨ 𝐴 = 𝐵)) |
| 19 | 18 | orcomd 884 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 = 𝐵 ∨ 𝐷(⟂G‘𝐺)(𝐴𝐿𝐵))) |
| 20 | 19 | ord 877 | . . . . . . 7 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 → 𝐷(⟂G‘𝐺)(𝐴𝐿𝐵))) |
| 21 | 4 | adantr 485 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐺 ∈ TarskiG) |
| 22 | 6 | adantr 485 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐴 ∈ 𝑃) |
| 23 | 7 | adantr 485 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐵 ∈ 𝑃) |
| 24 | simpr 489 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → ¬ 𝐴 = 𝐵) | |
| 25 | 24 | neqned 2965 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐴 ≠ 𝐵) |
| 26 | 1, 3, 12, 21, 22, 23, 25 | tglinecom 28908 | . . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → (𝐴𝐿𝐵) = (𝐵𝐿𝐴)) |
| 27 | 26 | breq2d 5121 | . . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ↔ 𝐷(⟂G‘𝐺)(𝐵𝐿𝐴))) |
| 28 | 27 | pm5.74da 815 | . . . . . . 7 ⊢ (𝜑 → ((¬ 𝐴 = 𝐵 → 𝐷(⟂G‘𝐺)(𝐴𝐿𝐵)) ↔ (¬ 𝐴 = 𝐵 → 𝐷(⟂G‘𝐺)(𝐵𝐿𝐴)))) |
| 29 | 20, 28 | mpbid 235 | . . . . . 6 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 → 𝐷(⟂G‘𝐺)(𝐵𝐿𝐴))) |
| 30 | 29 | orrd 876 | . . . . 5 ⊢ (𝜑 → (𝐴 = 𝐵 ∨ 𝐷(⟂G‘𝐺)(𝐵𝐿𝐴))) |
| 31 | 30 | orcomd 884 | . . . 4 ⊢ (𝜑 → (𝐷(⟂G‘𝐺)(𝐵𝐿𝐴) ∨ 𝐴 = 𝐵)) |
| 32 | eqcom 2770 | . . . . 5 ⊢ (𝐴 = 𝐵 ↔ 𝐵 = 𝐴) | |
| 33 | 32 | orbi2i 925 | . . . 4 ⊢ ((𝐷(⟂G‘𝐺)(𝐵𝐿𝐴) ∨ 𝐴 = 𝐵) ↔ (𝐷(⟂G‘𝐺)(𝐵𝐿𝐴) ∨ 𝐵 = 𝐴)) |
| 34 | 31, 33 | sylib 221 | . . 3 ⊢ (𝜑 → (𝐷(⟂G‘𝐺)(𝐵𝐿𝐴) ∨ 𝐵 = 𝐴)) |
| 35 | 1, 2, 3, 4, 5, 11, 12, 13, 7, 6 | islmib 29096 | . . 3 ⊢ (𝜑 → (𝐴 = (𝑀‘𝐵) ↔ ((𝐵(midG‘𝐺)𝐴) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐵𝐿𝐴) ∨ 𝐵 = 𝐴)))) |
| 36 | 17, 34, 35 | mpbir2and 725 | . 2 ⊢ (𝜑 → 𝐴 = (𝑀‘𝐵)) |
| 37 | 36 | eqcomd 2769 | 1 ⊢ (𝜑 → (𝑀‘𝐵) = 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 class class class wbr 5109 ran crn 5662 ‘cfv 6536 (class class class)co 7410 2c2 12290 Basecbs 17264 distcds 17314 TarskiGcstrkg 28696 DimTarskiG≥cstrkgld 28700 Itvcitv 28702 LineGclng 28703 ⟂Gcperpg 28975 midGcmid 29081 lInvGclmi 29082 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-oadd 8453 df-er 8690 df-map 8822 df-pm 8823 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-dju 9883 df-card 9921 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-2 12298 df-3 12299 df-n0 12500 df-xnn0 12573 df-z 12587 df-uz 12858 df-fz 13531 df-fzo 13679 df-hash 14363 df-word 14547 df-concat 14604 df-s1 14630 df-s2 14881 df-s3 14882 df-trkgc 28717 df-trkgb 28718 df-trkgcb 28719 df-trkgld 28721 df-trkg 28722 df-cgrg 28780 df-leg 28852 df-mir 28930 df-rag 28974 df-perpg 28976 df-mid 29083 df-lmi 29084 |
| This theorem is referenced by: lmilmi 29098 |
| Copyright terms: Public domain | W3C validator |