| 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 28469. (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 28645 | . 2 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑃) |
| 11 | mirtrcgr.x | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 12 | mirtrcgr.y | . 2 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 13 | mirtrcgr.n | . . 3 ⊢ 𝑁 = (𝑆‘𝑌) | |
| 14 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mircl 28645 | . 2 ⊢ (𝜑 → (𝑁‘𝑋) ∈ 𝑃) |
| 15 | 1, 2, 3, 7, 8, 4, 6, 9, 5 | mirbtwn 28642 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ((𝑀‘𝐴)𝐼𝐴)) |
| 16 | 1, 2, 3, 4, 10, 6, 5, 15 | tgbtwncom 28472 | . 2 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼(𝑀‘𝐴))) |
| 17 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mirbtwn 28642 | . . 3 ⊢ (𝜑 → 𝑌 ∈ ((𝑁‘𝑋)𝐼𝑋)) |
| 18 | 1, 2, 3, 4, 14, 12, 11, 17 | tgbtwncom 28472 | . 2 ⊢ (𝜑 → 𝑌 ∈ (𝑋𝐼(𝑁‘𝑋))) |
| 19 | mircgrextend.1 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝑋 − 𝑌)) | |
| 20 | 1, 2, 3, 4, 5, 6, 11, 12, 19 | tgcgrcomlr 28464 | . . 3 ⊢ (𝜑 → (𝐵 − 𝐴) = (𝑌 − 𝑋)) |
| 21 | 1, 2, 3, 7, 8, 4, 6, 9, 5 | mircgr 28641 | . . 3 ⊢ (𝜑 → (𝐵 − (𝑀‘𝐴)) = (𝐵 − 𝐴)) |
| 22 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mircgr 28641 | . . 3 ⊢ (𝜑 → (𝑌 − (𝑁‘𝑋)) = (𝑌 − 𝑋)) |
| 23 | 20, 21, 22 | 3eqtr4d 2776 | . 2 ⊢ (𝜑 → (𝐵 − (𝑀‘𝐴)) = (𝑌 − (𝑁‘𝑋))) |
| 24 | 1, 2, 3, 4, 5, 6, 10, 11, 12, 14, 16, 18, 19, 23 | tgcgrextend 28469 | 1 ⊢ (𝜑 → (𝐴 − (𝑀‘𝐴)) = (𝑋 − (𝑁‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2111 ‘cfv 6487 (class class class)co 7352 Basecbs 17126 distcds 17176 TarskiGcstrkg 28411 Itvcitv 28417 LineGclng 28418 cgrGccgrg 28494 pInvGcmir 28636 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5219 ax-sep 5236 ax-nul 5246 ax-pr 5372 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7309 df-ov 7355 df-trkgc 28432 df-trkgb 28433 df-trkgcb 28434 df-trkg 28437 df-mir 28637 |
| This theorem is referenced by: mirtrcgr 28667 |
| Copyright terms: Public domain | W3C validator |