| 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 29167 | . . . 4 ⊢ (𝜑 → (𝐴(midG‘𝐺)𝐵) = (𝐵(midG‘𝐺)𝐴)) |
| 9 | lmicom.1 | . . . . . . 7 ⊢ (𝜑 → (𝑀‘𝐴) = 𝐵) | |
| 10 | 9 | eqcomd 2766 | . . . . . 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 29172 | . . . . . 6 ⊢ (𝜑 → (𝐵 = (𝑀‘𝐴) ↔ ((𝐴(midG‘𝐺)𝐵) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ∨ 𝐴 = 𝐵)))) |
| 15 | 10, 14 | mpbid 235 | . . . . 5 ⊢ (𝜑 → ((𝐴(midG‘𝐺)𝐵) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ∨ 𝐴 = 𝐵))) |
| 16 | 15 | simpld 500 | . . . 4 ⊢ (𝜑 → (𝐴(midG‘𝐺)𝐵) ∈ 𝐷) |
| 17 | 8, 16 | eqeltrrd 2861 | . . 3 ⊢ (𝜑 → (𝐵(midG‘𝐺)𝐴) ∈ 𝐷) |
| 18 | 15 | simprd 501 | . . . . . . . . 9 ⊢ (𝜑 → (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ∨ 𝐴 = 𝐵)) |
| 19 | 18 | orcomd 885 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 = 𝐵 ∨ 𝐷(⟂G‘𝐺)(𝐴𝐿𝐵))) |
| 20 | 19 | ord 878 | . . . . . . 7 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 → 𝐷(⟂G‘𝐺)(𝐴𝐿𝐵))) |
| 21 | 4 | adantr 486 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐺 ∈ TarskiG) |
| 22 | 6 | adantr 486 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐴 ∈ 𝑃) |
| 23 | 7 | adantr 486 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐵 ∈ 𝑃) |
| 24 | simpr 490 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → ¬ 𝐴 = 𝐵) | |
| 25 | 24 | neqned 2962 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐴 ≠ 𝐵) |
| 26 | 1, 3, 12, 21, 22, 23, 25 | tglinecom 28983 | . . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → (𝐴𝐿𝐵) = (𝐵𝐿𝐴)) |
| 27 | 26 | breq2d 5115 | . . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ↔ 𝐷(⟂G‘𝐺)(𝐵𝐿𝐴))) |
| 28 | 27 | pm5.74da 816 | . . . . . . 7 ⊢ (𝜑 → ((¬ 𝐴 = 𝐵 → 𝐷(⟂G‘𝐺)(𝐴𝐿𝐵)) ↔ (¬ 𝐴 = 𝐵 → 𝐷(⟂G‘𝐺)(𝐵𝐿𝐴)))) |
| 29 | 20, 28 | mpbid 235 | . . . . . 6 ⊢ (𝜑 → (¬ 𝐴 = 𝐵 → 𝐷(⟂G‘𝐺)(𝐵𝐿𝐴))) |
| 30 | 29 | orrd 877 | . . . . 5 ⊢ (𝜑 → (𝐴 = 𝐵 ∨ 𝐷(⟂G‘𝐺)(𝐵𝐿𝐴))) |
| 31 | 30 | orcomd 885 | . . . 4 ⊢ (𝜑 → (𝐷(⟂G‘𝐺)(𝐵𝐿𝐴) ∨ 𝐴 = 𝐵)) |
| 32 | eqcom 2767 | . . . . 5 ⊢ (𝐴 = 𝐵 ↔ 𝐵 = 𝐴) | |
| 33 | 32 | orbi2i 926 | . . . 4 ⊢ ((𝐷(⟂G‘𝐺)(𝐵𝐿𝐴) ∨ 𝐴 = 𝐵) ↔ (𝐷(⟂G‘𝐺)(𝐵𝐿𝐴) ∨ 𝐵 = 𝐴)) |
| 34 | 31, 33 | sylib 221 | . . 3 ⊢ (𝜑 → (𝐷(⟂G‘𝐺)(𝐵𝐿𝐴) ∨ 𝐵 = 𝐴)) |
| 35 | 1, 2, 3, 4, 5, 11, 12, 13, 7, 6 | islmib 29172 | . . 3 ⊢ (𝜑 → (𝐴 = (𝑀‘𝐵) ↔ ((𝐵(midG‘𝐺)𝐴) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐵𝐿𝐴) ∨ 𝐵 = 𝐴)))) |
| 36 | 17, 34, 35 | mpbir2and 726 | . 2 ⊢ (𝜑 → 𝐴 = (𝑀‘𝐵)) |
| 37 | 36 | eqcomd 2766 | 1 ⊢ (𝜑 → (𝑀‘𝐵) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ran crn 5656 ‘cfv 6533 (class class class)co 7414 2c2 12320 Basecbs 17302 distcds 17352 TarskiGcstrkg 28769 DimTarskiG≥cstrkgld 28773 Itvcitv 28775 LineGclng 28776 ⟂Gcperpg 29050 midGcmid 29157 lInvGclmi 29158 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-1o 8456 df-oadd 8460 df-er 8697 df-map 8829 df-pm 8830 df-en 8954 df-dom 8955 df-sdom 8956 df-fin 8957 df-dju 9907 df-card 9945 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-2 12328 df-3 12329 df-n0 12530 df-xnn0 12603 df-z 12617 df-uz 12889 df-fz 13563 df-fzo 13711 df-hash 14396 df-word 14580 df-concat 14637 df-s1 14664 df-s2 14920 df-s3 14921 df-trkgc 28790 df-trkgb 28791 df-trkgcb 28792 df-trkgld 28794 df-trkg 28795 df-cgrg 28854 df-leg 28926 df-mir 29005 df-rag 29049 df-perpg 29051 df-mid 29159 df-lmi 29160 |
| This theorem is used by: lmilmi 29174 |
| Copyright terms: Public domain | W3C validator |