| 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 29299 | . . . 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 29304 | . . . . . 6 ⊢ (𝜑 → (𝐵 = (𝑀‘𝐴) ↔ ((𝐴(midG‘𝐺)𝐵) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ∨ 𝐴 = 𝐵)))) |
| 15 | 10, 14 | mpbid 235 | . . . . 5 ⊢ (𝜑 → ((𝐴(midG‘𝐺)𝐵) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ∨ 𝐴 = 𝐵))) |
| 16 | 15 | simpld 500 | . . . 4 ⊢ (𝜑 → (𝐴(midG‘𝐺)𝐵) ∈ 𝐷) |
| 17 | 8, 16 | eqeltrrd 2864 | . . 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 2965 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐴 ≠ 𝐵) |
| 26 | 1, 3, 12, 21, 22, 23, 25 | tglinecom 29115 | . . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → (𝐴𝐿𝐵) = (𝐵𝐿𝐴)) |
| 27 | 26 | breq2d 5117 | . . . . . . . 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 2770 | . . . . 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 29304 | . . 3 ⊢ (𝜑 → (𝐴 = (𝑀‘𝐵) ↔ ((𝐵(midG‘𝐺)𝐴) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐵𝐿𝐴) ∨ 𝐵 = 𝐴)))) |
| 36 | 17, 34, 35 | mpbir2and 726 | . 2 ⊢ (𝜑 → 𝐴 = (𝑀‘𝐵)) |
| 37 | 36 | eqcomd 2769 | 1 ⊢ (𝜑 → (𝑀‘𝐵) = 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1569 ∈ wcel 2146 class class class wbr 5105 ran crn 5655 ‘cfv 6546 (class class class)co 7427 2c2 12407 Basecbs 17399 distcds 17449 TarskiGcstrkg 28901 DimTarskiG≥cstrkgld 28905 Itvcitv 28907 LineGclng 28908 ⟂Gcperpg 29182 midGcmid 29289 lInvGclmi 29290 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 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 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4838 df-uni 4870 df-int 4910 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-1st 8008 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-1o 8487 df-oadd 8491 df-er 8728 df-map 8860 df-pm 8861 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-dju 9992 df-card 10030 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-nn 12346 df-2 12415 df-3 12416 df-n0 12617 df-xnn0 12690 df-z 12704 df-uz 12976 df-fz 13650 df-fzo 13799 df-hash 14485 df-word 14669 df-concat 14726 df-s1 14753 df-s2 15010 df-s3 15011 df-trkgc 28922 df-trkgb 28923 df-trkgcb 28924 df-trkgld 28926 df-trkg 28927 df-cgrg 28986 df-leg 29058 df-mir 29137 df-rag 29181 df-perpg 29183 df-mid 29291 df-lmi 29292 |
| This theorem is used by: lmilmi 29306 |
| Copyright terms: Public domain | W3C validator |