Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mirln2 | Structured version Visualization version GIF version |
Description: If a point and its mirror point are both on the same line, so is the center of the point inversion. (Contributed by Thierry Arnoux, 3-Mar-2020.) |
Ref | Expression |
---|---|
mirval.p | ⊢ 𝑃 = (Base‘𝐺) |
mirval.d | ⊢ − = (dist‘𝐺) |
mirval.i | ⊢ 𝐼 = (Itv‘𝐺) |
mirval.l | ⊢ 𝐿 = (LineG‘𝐺) |
mirval.s | ⊢ 𝑆 = (pInvG‘𝐺) |
mirval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
mirln2.m | ⊢ 𝑀 = (𝑆‘𝐴) |
mirln2.d | ⊢ (𝜑 → 𝐷 ∈ ran 𝐿) |
mirln2.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
mirln2.1 | ⊢ (𝜑 → 𝐵 ∈ 𝐷) |
mirln2.2 | ⊢ (𝜑 → (𝑀‘𝐵) ∈ 𝐷) |
Ref | Expression |
---|---|
mirln2 | ⊢ (𝜑 → 𝐴 ∈ 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mirval.p | . . . . 5 ⊢ 𝑃 = (Base‘𝐺) | |
2 | mirval.d | . . . . 5 ⊢ − = (dist‘𝐺) | |
3 | mirval.i | . . . . 5 ⊢ 𝐼 = (Itv‘𝐺) | |
4 | mirval.l | . . . . 5 ⊢ 𝐿 = (LineG‘𝐺) | |
5 | mirval.s | . . . . 5 ⊢ 𝑆 = (pInvG‘𝐺) | |
6 | mirval.g | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
7 | mirln2.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
8 | mirln2.m | . . . . 5 ⊢ 𝑀 = (𝑆‘𝐴) | |
9 | mirln2.d | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ ran 𝐿) | |
10 | mirln2.1 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝐷) | |
11 | 1, 4, 3, 6, 9, 10 | tglnpt 26262 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
12 | 1, 2, 3, 4, 5, 6, 7, 8, 11 | mirinv 26379 | . . . 4 ⊢ (𝜑 → ((𝑀‘𝐵) = 𝐵 ↔ 𝐴 = 𝐵)) |
13 | 12 | biimpa 477 | . . 3 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 = 𝐵) |
14 | 10 | adantr 481 | . . 3 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐵 ∈ 𝐷) |
15 | 13, 14 | eqeltrd 2910 | . 2 ⊢ ((𝜑 ∧ (𝑀‘𝐵) = 𝐵) → 𝐴 ∈ 𝐷) |
16 | 6 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → 𝐺 ∈ TarskiG) |
17 | mirln2.2 | . . . . . 6 ⊢ (𝜑 → (𝑀‘𝐵) ∈ 𝐷) | |
18 | 1, 4, 3, 6, 9, 17 | tglnpt 26262 | . . . . 5 ⊢ (𝜑 → (𝑀‘𝐵) ∈ 𝑃) |
19 | 18 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → (𝑀‘𝐵) ∈ 𝑃) |
20 | 11 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → 𝐵 ∈ 𝑃) |
21 | 7 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → 𝐴 ∈ 𝑃) |
22 | simpr 485 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → (𝑀‘𝐵) ≠ 𝐵) | |
23 | 1, 2, 3, 4, 5, 16, 21, 8, 20 | mirbtwn 26371 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → 𝐴 ∈ ((𝑀‘𝐵)𝐼𝐵)) |
24 | 1, 3, 4, 16, 19, 20, 21, 22, 23 | btwnlng1 26332 | . . 3 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → 𝐴 ∈ ((𝑀‘𝐵)𝐿𝐵)) |
25 | 9 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → 𝐷 ∈ ran 𝐿) |
26 | 17 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → (𝑀‘𝐵) ∈ 𝐷) |
27 | 10 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → 𝐵 ∈ 𝐷) |
28 | 1, 3, 4, 16, 19, 20, 22, 22, 25, 26, 27 | tglinethru 26349 | . . 3 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → 𝐷 = ((𝑀‘𝐵)𝐿𝐵)) |
29 | 24, 28 | eleqtrrd 2913 | . 2 ⊢ ((𝜑 ∧ (𝑀‘𝐵) ≠ 𝐵) → 𝐴 ∈ 𝐷) |
30 | 15, 29 | pm2.61dane 3101 | 1 ⊢ (𝜑 → 𝐴 ∈ 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ≠ wne 3013 ran crn 5549 ‘cfv 6348 (class class class)co 7145 Basecbs 16471 distcds 16562 TarskiGcstrkg 26143 Itvcitv 26149 LineGclng 26150 pInvGcmir 26365 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-oadd 8095 df-er 8278 df-pm 8398 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-dju 9318 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-2 11688 df-3 11689 df-n0 11886 df-xnn0 11956 df-z 11970 df-uz 12232 df-fz 12881 df-fzo 13022 df-hash 13679 df-word 13850 df-concat 13911 df-s1 13938 df-s2 14198 df-s3 14199 df-trkgc 26161 df-trkgb 26162 df-trkgcb 26163 df-trkg 26166 df-cgrg 26224 df-mir 26366 |
This theorem is referenced by: opphl 26467 |
Copyright terms: Public domain | W3C validator |