| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > miduniq | Structured version Visualization version GIF version | ||
| Description: Uniqueness of the middle point, expressed with point inversion. Theorem 7.17 of [Schwabhauser] p. 51. (Contributed by Thierry Arnoux, 30-Jul-2019.) |
| Ref | Expression |
|---|---|
| mirval.p | ⊢ 𝑃 = (Base‘𝐺) |
| mirval.d | ⊢ − = (dist‘𝐺) |
| mirval.i | ⊢ 𝐼 = (Itv‘𝐺) |
| mirval.l | ⊢ 𝐿 = (LineG‘𝐺) |
| mirval.s | ⊢ 𝑆 = (pInvG‘𝐺) |
| mirval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| miduniq.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| miduniq.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| miduniq.x | ⊢ (𝜑 → 𝑋 ∈ 𝑃) |
| miduniq.y | ⊢ (𝜑 → 𝑌 ∈ 𝑃) |
| miduniq.e | ⊢ (𝜑 → ((𝑆‘𝐴)‘𝑋) = 𝑌) |
| miduniq.f | ⊢ (𝜑 → ((𝑆‘𝐵)‘𝑋) = 𝑌) |
| Ref | Expression |
|---|---|
| miduniq | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mirval.p | . . . 4 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | mirval.l | . . . 4 ⊢ 𝐿 = (LineG‘𝐺) | |
| 3 | mirval.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | mirval.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | miduniq.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝑃) | |
| 6 | miduniq.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝑃) | |
| 7 | miduniq.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 8 | eqid 2765 | . . . 4 ⊢ (cgrG‘𝐺) = (cgrG‘𝐺) | |
| 9 | mirval.d | . . . . 5 ⊢ − = (dist‘𝐺) | |
| 10 | mirval.s | . . . . 5 ⊢ 𝑆 = (pInvG‘𝐺) | |
| 11 | miduniq.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 12 | eqid 2765 | . . . . 5 ⊢ (𝑆‘𝐴) = (𝑆‘𝐴) | |
| 13 | 1, 9, 3, 2, 10, 4, 11, 12, 7 | mircl 28888 | . . . 4 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) ∈ 𝑃) |
| 14 | eqid 2765 | . . . . . . 7 ⊢ (𝑆‘𝐵) = (𝑆‘𝐵) | |
| 15 | 1, 9, 3, 2, 10, 4, 7, 14, 5 | mirbtwn 28885 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ (((𝑆‘𝐵)‘𝑋)𝐼𝑋)) |
| 16 | miduniq.f | . . . . . . 7 ⊢ (𝜑 → ((𝑆‘𝐵)‘𝑋) = 𝑌) | |
| 17 | 16 | oveq1d 7415 | . . . . . 6 ⊢ (𝜑 → (((𝑆‘𝐵)‘𝑋)𝐼𝑋) = (𝑌𝐼𝑋)) |
| 18 | 15, 17 | eleqtrd 2867 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ (𝑌𝐼𝑋)) |
| 19 | 1, 9, 3, 4, 6, 7, 5, 18 | tgbtwncom 28711 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ (𝑋𝐼𝑌)) |
| 20 | 1, 9, 3, 2, 10, 4, 11, 12, 6, 7 | miriso 28897 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑌) − ((𝑆‘𝐴)‘𝐵)) = (𝑌 − 𝐵)) |
| 21 | miduniq.e | . . . . . . 7 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝑋) = 𝑌) | |
| 22 | 1, 9, 3, 2, 10, 4, 11, 12, 5, 21 | mircom 28890 | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝑌) = 𝑋) |
| 23 | 22 | oveq1d 7415 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑌) − ((𝑆‘𝐴)‘𝐵)) = (𝑋 − ((𝑆‘𝐴)‘𝐵))) |
| 24 | 1, 9, 3, 2, 10, 4, 7, 14, 5 | mircgr 28884 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 − ((𝑆‘𝐵)‘𝑋)) = (𝐵 − 𝑋)) |
| 25 | 16 | oveq2d 7416 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 − ((𝑆‘𝐵)‘𝑋)) = (𝐵 − 𝑌)) |
| 26 | 24, 25 | eqtr3d 2802 | . . . . . . 7 ⊢ (𝜑 → (𝐵 − 𝑋) = (𝐵 − 𝑌)) |
| 27 | 26 | eqcomd 2771 | . . . . . 6 ⊢ (𝜑 → (𝐵 − 𝑌) = (𝐵 − 𝑋)) |
| 28 | 1, 9, 3, 4, 7, 6, 7, 5, 27 | tgcgrcomlr 28703 | . . . . 5 ⊢ (𝜑 → (𝑌 − 𝐵) = (𝑋 − 𝐵)) |
| 29 | 20, 23, 28 | 3eqtr3rd 2809 | . . . 4 ⊢ (𝜑 → (𝑋 − 𝐵) = (𝑋 − ((𝑆‘𝐴)‘𝐵))) |
| 30 | 1, 9, 3, 2, 10, 4, 11, 12, 5, 7 | miriso 28897 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑋) − ((𝑆‘𝐴)‘𝐵)) = (𝑋 − 𝐵)) |
| 31 | 21 | oveq1d 7415 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑋) − ((𝑆‘𝐴)‘𝐵)) = (𝑌 − ((𝑆‘𝐴)‘𝐵))) |
| 32 | 1, 9, 3, 4, 7, 5, 7, 6, 26 | tgcgrcomlr 28703 | . . . . 5 ⊢ (𝜑 → (𝑋 − 𝐵) = (𝑌 − 𝐵)) |
| 33 | 30, 31, 32 | 3eqtr3rd 2809 | . . . 4 ⊢ (𝜑 → (𝑌 − 𝐵) = (𝑌 − ((𝑆‘𝐴)‘𝐵))) |
| 34 | 1, 2, 3, 4, 5, 6, 7, 8, 13, 11, 9, 19, 29, 33 | tgidinside 28794 | . . 3 ⊢ (𝜑 → 𝐵 = ((𝑆‘𝐴)‘𝐵)) |
| 35 | 34 | eqcomd 2771 | . 2 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) = 𝐵) |
| 36 | 1, 9, 3, 2, 10, 4, 11, 12, 7 | mirinv 28893 | . 2 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝐵) = 𝐵 ↔ 𝐴 = 𝐵)) |
| 37 | 35, 36 | mpbid 235 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ∈ wcel 2145 ‘cfv 6525 (class class class)co 7400 Basecbs 17257 distcds 17307 TarskiGcstrkg 28650 Itvcitv 28656 LineGclng 28657 cgrGccgrg 28733 pInvGcmir 28879 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-uni 4868 df-int 4908 df-iun 4953 df-br 5105 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6291 df-ord 6352 df-on 6353 df-lim 6354 df-suc 6355 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-oadd 8445 df-er 8682 df-pm 8815 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-dju 9875 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-nn 12222 df-2 12291 df-3 12292 df-n0 12493 df-xnn0 12566 df-z 12580 df-uz 12851 df-fz 13524 df-fzo 13671 df-hash 14355 df-word 14539 df-concat 14596 df-s1 14622 df-s2 14873 df-s3 14874 df-trkgc 28671 df-trkgb 28672 df-trkgcb 28673 df-trkg 28676 df-cgrg 28734 df-mir 28880 |
| This theorem is referenced by: miduniq1 28913 krippenlem 28917 mideu 28965 opphllem3 28976 |
| Copyright terms: Public domain | W3C validator |