| 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 28881. (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 29067 | . 2 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑃) |
| 11 | mirtrcgr.x | . 2 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 12 | mirtrcgr.y | . 2 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 13 | mirtrcgr.n | . . 3 ⊢ 𝑁 = (𝑆‘𝑌) | |
| 14 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mircl 29067 | . 2 ⊢ (𝜑 → (𝑁‘𝑋) ∈ 𝑃) |
| 15 | 1, 2, 3, 7, 8, 4, 6, 9, 5 | mirbtwn 29064 | . . 3 ⊢ (𝜑 → 𝐵 ∈ ((𝑀‘𝐴)𝐼𝐴)) |
| 16 | 1, 2, 3, 4, 10, 6, 5, 15 | tgbtwncom 28885 | . 2 ⊢ (𝜑 → 𝐵 ∈ (𝐴𝐼(𝑀‘𝐴))) |
| 17 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mirbtwn 29064 | . . 3 ⊢ (𝜑 → 𝑌 ∈ ((𝑁‘𝑋)𝐼𝑋)) |
| 18 | 1, 2, 3, 4, 14, 12, 11, 17 | tgbtwncom 28885 | . 2 ⊢ (𝜑 → 𝑌 ∈ (𝑋𝐼(𝑁‘𝑋))) |
| 19 | mircgrextend.1 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝑋 − 𝑌)) | |
| 20 | 1, 2, 3, 4, 5, 6, 11, 12, 19 | tgcgrcomlr 28876 | . . 3 ⊢ (𝜑 → (𝐵 − 𝐴) = (𝑌 − 𝑋)) |
| 21 | 1, 2, 3, 7, 8, 4, 6, 9, 5 | mircgr 29063 | . . 3 ⊢ (𝜑 → (𝐵 − (𝑀‘𝐴)) = (𝐵 − 𝐴)) |
| 22 | 1, 2, 3, 7, 8, 4, 12, 13, 11 | mircgr 29063 | . . 3 ⊢ (𝜑 → (𝑌 − (𝑁‘𝑋)) = (𝑌 − 𝑋)) |
| 23 | 20, 21, 22 | 3eqtr4d 2805 | . 2 ⊢ (𝜑 → (𝐵 − (𝑀‘𝐴)) = (𝑌 − (𝑁‘𝑋))) |
| 24 | 1, 2, 3, 4, 5, 6, 10, 11, 12, 14, 16, 18, 19, 23 | tgcgrextend 28881 | 1 ⊢ (𝜑 → (𝐴 − (𝑀‘𝐴)) = (𝑋 − (𝑁‘𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ‘cfv 6527 (class class class)co 7408 Basecbs 17349 distcds 17399 TarskiGcstrkg 28823 Itvcitv 28829 LineGclng 28830 cgrGccgrg 28907 pInvGcmir 29058 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-iota 6483 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7365 df-ov 7411 df-trkgc 28844 df-trkgb 28845 df-trkgcb 28846 df-trkg 28849 df-mir 29059 |
| This theorem is used by: mirtrcgr 29089 |
| Copyright terms: Public domain | W3C validator |