| 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 29344 | . . . 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 29349 | . . . . . 6 ⊢ (𝜑 → (𝐵 = (𝑀‘𝐴) ↔ ((𝐴(midG‘𝐺)𝐵) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ∨ 𝐴 = 𝐵)))) |
| 15 | 10, 14 | mpbid 235 | . . . . 5 ⊢ (𝜑 → ((𝐴(midG‘𝐺)𝐵) ∈ 𝐷 ∧ (𝐷(⟂G‘𝐺)(𝐴𝐿𝐵) ∨ 𝐴 = 𝐵))) |
| 16 | 15 | simpld 500 | . . . 4 ⊢ (𝜑 → (𝐴(midG‘𝐺)𝐵) ∈ 𝐷) |
| 17 | 8, 16 | eqeltrrd 2865 | . . 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 2966 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → 𝐴 ≠ 𝐵) |
| 26 | 1, 3, 12, 21, 22, 23, 25 | tglinecom 29160 | . . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝐴 = 𝐵) → (𝐴𝐿𝐵) = (𝐵𝐿𝐴)) |
| 27 | 26 | breq2d 5120 | . . . . . . . 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 29349 | . . 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 1570 ∈ wcel 2147 class class class wbr 5108 ran crn 5659 ‘cfv 6566 (class class class)co 7451 2c2 12437 Basecbs 17431 distcds 17481 TarskiGcstrkg 28946 DimTarskiG≥cstrkgld 28950 Itvcitv 28952 LineGclng 28953 ⟂Gcperpg 29227 midGcmid 29334 lInvGclmi 29335 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-oadd 8518 df-er 8755 df-map 8887 df-pm 8888 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-dju 10019 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-xnn0 12720 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700 df-concat 14757 df-s1 14784 df-s2 15041 df-s3 15042 df-trkgc 28967 df-trkgb 28968 df-trkgcb 28969 df-trkgld 28971 df-trkg 28972 df-cgrg 29031 df-leg 29103 df-mir 29182 df-rag 29226 df-perpg 29228 df-mid 29336 df-lmi 29337 |
| This theorem is used by: lmilmi 29351 |
| Copyright terms: Public domain | W3C validator |