| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mircgrextend | Structured version Visualization version GIF version | ||
| Description: Link congruence over a pair of mirror points. cf tgcgrextend 28418. (Contributed by Thierry Arnoux, 4-Oct-2020.) |
| Ref | Expression |
|---|---|
| mirval.p | ⊢ 𝑃 = (Base‘𝐺) |
| mirval.d | ⊢ − = (dist‘𝐺) |
| mirval.i | ⊢ 𝐼 = (Itv‘𝐺) |
| mirval.l | ⊢ 𝐿 = (LineG‘𝐺) |
| mirval.s | ⊢ 𝑆 = (pInvG‘𝐺) |
| mirval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| mirtrcgr.e | ⊢ ∼ = (cgrG‘𝐺) |
| mirtrcgr.m | ⊢ 𝑀 = (𝑆‘𝐵) |
| mirtrcgr.n | ⊢ 𝑁 = (𝑆‘𝑌) |
| mirtrcgr.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| mirtrcgr.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| mirtrcgr.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
| mirtrcgr.y | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
| mircgrextend.1 | ⊢ (𝜑 → (𝐴 − 𝐵) = (𝑋 − 𝑌)) |
| Ref | Expression |
|---|---|
| mircgrextend | ⊢ (𝜑 → (𝐴 − (𝑀‘𝐴)) = (𝑋 − (𝑁‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mirval.p | . 2 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | mirval.d | . 2 ⊢ − = (dist‘𝐺) | |
| 3 | mirval.i | . 2 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | mirval.g | . 2 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | mirtrcgr.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 6 | mirtrcgr.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 7 | mirval.l | . . 3 ⊢ 𝐿 = (LineG‘𝐺) | |
| 8 | mirval.s | . . 3 ⊢ 𝑆 = (pInvG‘𝐺) | |
| 9 | mirtrcgr.m | . . 3 ⊢ 𝑀 = (𝑆‘𝐵) | |
| 10 | 1, 2, 3, 7, 8, 4, 6, 9, 5 | mircl 28594 | . 2 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑃) |
| 11 | mirtrcgr.x | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 12 | mirtrcgr.y | . 2 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 13 | mirtrcgr.n | . . 3 ⊢ 𝑁 = (𝑆‘𝑌) | |
| 14 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mircl 28594 | . 2 ⊢ (𝜑 → (𝑁‘𝑋) ∈ 𝑃) |
| 15 | 1, 2, 3, 7, 8, 4, 6, 9, 5 | mirbtwn 28591 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ((𝑀‘𝐴)𝐼𝐴)) |
| 16 | 1, 2, 3, 4, 10, 6, 5, 15 | tgbtwncom 28421 | . 2 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼(𝑀‘𝐴))) |
| 17 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mirbtwn 28591 | . . 3 ⊢ (𝜑 → 𝑌 ∈ ((𝑁‘𝑋)𝐼𝑋)) |
| 18 | 1, 2, 3, 4, 14, 12, 11, 17 | tgbtwncom 28421 | . 2 ⊢ (𝜑 → 𝑌 ∈ (𝑋𝐼(𝑁‘𝑋))) |
| 19 | mircgrextend.1 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝑋 − 𝑌)) | |
| 20 | 1, 2, 3, 4, 5, 6, 11, 12, 19 | tgcgrcomlr 28413 | . . 3 ⊢ (𝜑 → (𝐵 − 𝐴) = (𝑌 − 𝑋)) |
| 21 | 1, 2, 3, 7, 8, 4, 6, 9, 5 | mircgr 28590 | . . 3 ⊢ (𝜑 → (𝐵 − (𝑀‘𝐴)) = (𝐵 − 𝐴)) |
| 22 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mircgr 28590 | . . 3 ⊢ (𝜑 → (𝑌 − (𝑁‘𝑋)) = (𝑌 − 𝑋)) |
| 23 | 20, 21, 22 | 3eqtr4d 2775 | . 2 ⊢ (𝜑 → (𝐵 − (𝑀‘𝐴)) = (𝑌 − (𝑁‘𝑋))) |
| 24 | 1, 2, 3, 4, 5, 6, 10, 11, 12, 14, 16, 18, 19, 23 | tgcgrextend 28418 | 1 ⊢ (𝜑 → (𝐴 − (𝑀‘𝐴)) = (𝑋 − (𝑁‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 ‘cfv 6513 (class class class)co 7389 Basecbs 17185 distcds 17235 TarskiGcstrkg 28360 Itvcitv 28366 LineGclng 28367 cgrGccgrg 28443 pInvGcmir 28585 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5236 ax-sep 5253 ax-nul 5263 ax-pr 5389 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-id 5535 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-riota 7346 df-ov 7392 df-trkgc 28381 df-trkgb 28382 df-trkgcb 28383 df-trkg 28386 df-mir 28586 |
| This theorem is referenced by: mirtrcgr 28616 |
| Copyright terms: Public domain | W3C validator |