| 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 28540. (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 28716 | . 2 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑃) |
| 11 | mirtrcgr.x | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 12 | mirtrcgr.y | . 2 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 13 | mirtrcgr.n | . . 3 ⊢ 𝑁 = (𝑆‘𝑌) | |
| 14 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mircl 28716 | . 2 ⊢ (𝜑 → (𝑁‘𝑋) ∈ 𝑃) |
| 15 | 1, 2, 3, 7, 8, 4, 6, 9, 5 | mirbtwn 28713 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ((𝑀‘𝐴)𝐼𝐴)) |
| 16 | 1, 2, 3, 4, 10, 6, 5, 15 | tgbtwncom 28543 | . 2 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼(𝑀‘𝐴))) |
| 17 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mirbtwn 28713 | . . 3 ⊢ (𝜑 → 𝑌 ∈ ((𝑁‘𝑋)𝐼𝑋)) |
| 18 | 1, 2, 3, 4, 14, 12, 11, 17 | tgbtwncom 28543 | . 2 ⊢ (𝜑 → 𝑌 ∈ (𝑋𝐼(𝑁‘𝑋))) |
| 19 | mircgrextend.1 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝑋 − 𝑌)) | |
| 20 | 1, 2, 3, 4, 5, 6, 11, 12, 19 | tgcgrcomlr 28535 | . . 3 ⊢ (𝜑 → (𝐵 − 𝐴) = (𝑌 − 𝑋)) |
| 21 | 1, 2, 3, 7, 8, 4, 6, 9, 5 | mircgr 28712 | . . 3 ⊢ (𝜑 → (𝐵 − (𝑀‘𝐴)) = (𝐵 − 𝐴)) |
| 22 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mircgr 28712 | . . 3 ⊢ (𝜑 → (𝑌 − (𝑁‘𝑋)) = (𝑌 − 𝑋)) |
| 23 | 20, 21, 22 | 3eqtr4d 2782 | . 2 ⊢ (𝜑 → (𝐵 − (𝑀‘𝐴)) = (𝑌 − (𝑁‘𝑋))) |
| 24 | 1, 2, 3, 4, 5, 6, 10, 11, 12, 14, 16, 18, 19, 23 | tgcgrextend 28540 | 1 ⊢ (𝜑 → (𝐴 − (𝑀‘𝐴)) = (𝑋 − (𝑁‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ‘cfv 6493 (class class class)co 7360 Basecbs 17140 distcds 17190 TarskiGcstrkg 28482 Itvcitv 28488 LineGclng 28489 cgrGccgrg 28565 pInvGcmir 28707 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5225 ax-sep 5242 ax-nul 5252 ax-pr 5378 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4949 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7317 df-ov 7363 df-trkgc 28503 df-trkgb 28504 df-trkgcb 28505 df-trkg 28508 df-mir 28708 |
| This theorem is referenced by: mirtrcgr 28738 |
| Copyright terms: Public domain | W3C validator |