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 2824 | . . . 4 ⊢ (cgrG‘𝐺) = (cgrG‘𝐺) | |
9 | mirval.d | . . . . 5 ⊢ − = (dist‘𝐺) | |
10 | mirval.s | . . . . 5 ⊢ 𝑆 = (pInvG‘𝐺) | |
11 | miduniq.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
12 | eqid 2824 | . . . . 5 ⊢ (𝑆‘𝐴) = (𝑆‘𝐴) | |
13 | 1, 9, 3, 2, 10, 4, 11, 12, 7 | mircl 26450 | . . . 4 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) ∈ 𝑃) |
14 | eqid 2824 | . . . . . . 7 ⊢ (𝑆‘𝐵) = (𝑆‘𝐵) | |
15 | 1, 9, 3, 2, 10, 4, 7, 14, 5 | mirbtwn 26447 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ (((𝑆‘𝐵)‘𝑋)𝐼𝑋)) |
16 | miduniq.f | . . . . . . 7 ⊢ (𝜑 → ((𝑆‘𝐵)‘𝑋) = 𝑌) | |
17 | 16 | oveq1d 7174 | . . . . . 6 ⊢ (𝜑 → (((𝑆‘𝐵)‘𝑋)𝐼𝑋) = (𝑌𝐼𝑋)) |
18 | 15, 17 | eleqtrd 2918 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ (𝑌𝐼𝑋)) |
19 | 1, 9, 3, 4, 6, 7, 5, 18 | tgbtwncom 26277 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ (𝑋𝐼𝑌)) |
20 | 1, 9, 3, 2, 10, 4, 11, 12, 6, 7 | miriso 26459 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑌) − ((𝑆‘𝐴)‘𝐵)) = (𝑌 − 𝐵)) |
21 | miduniq.e | . . . . . . 7 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝑋) = 𝑌) | |
22 | 1, 9, 3, 2, 10, 4, 11, 12, 5, 21 | mircom 26452 | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝑌) = 𝑋) |
23 | 22 | oveq1d 7174 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑌) − ((𝑆‘𝐴)‘𝐵)) = (𝑋 − ((𝑆‘𝐴)‘𝐵))) |
24 | 1, 9, 3, 2, 10, 4, 7, 14, 5 | mircgr 26446 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 − ((𝑆‘𝐵)‘𝑋)) = (𝐵 − 𝑋)) |
25 | 16 | oveq2d 7175 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 − ((𝑆‘𝐵)‘𝑋)) = (𝐵 − 𝑌)) |
26 | 24, 25 | eqtr3d 2861 | . . . . . . 7 ⊢ (𝜑 → (𝐵 − 𝑋) = (𝐵 − 𝑌)) |
27 | 26 | eqcomd 2830 | . . . . . 6 ⊢ (𝜑 → (𝐵 − 𝑌) = (𝐵 − 𝑋)) |
28 | 1, 9, 3, 4, 7, 6, 7, 5, 27 | tgcgrcomlr 26269 | . . . . 5 ⊢ (𝜑 → (𝑌 − 𝐵) = (𝑋 − 𝐵)) |
29 | 20, 23, 28 | 3eqtr3rd 2868 | . . . 4 ⊢ (𝜑 → (𝑋 − 𝐵) = (𝑋 − ((𝑆‘𝐴)‘𝐵))) |
30 | 1, 9, 3, 2, 10, 4, 11, 12, 5, 7 | miriso 26459 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑋) − ((𝑆‘𝐴)‘𝐵)) = (𝑋 − 𝐵)) |
31 | 21 | oveq1d 7174 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑋) − ((𝑆‘𝐴)‘𝐵)) = (𝑌 − ((𝑆‘𝐴)‘𝐵))) |
32 | 1, 9, 3, 4, 7, 5, 7, 6, 26 | tgcgrcomlr 26269 | . . . . 5 ⊢ (𝜑 → (𝑋 − 𝐵) = (𝑌 − 𝐵)) |
33 | 30, 31, 32 | 3eqtr3rd 2868 | . . . 4 ⊢ (𝜑 → (𝑌 − 𝐵) = (𝑌 − ((𝑆‘𝐴)‘𝐵))) |
34 | 1, 2, 3, 4, 5, 6, 7, 8, 13, 11, 9, 19, 29, 33 | tgidinside 26360 | . . 3 ⊢ (𝜑 → 𝐵 = ((𝑆‘𝐴)‘𝐵)) |
35 | 34 | eqcomd 2830 | . 2 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) = 𝐵) |
36 | 1, 9, 3, 2, 10, 4, 11, 12, 7 | mirinv 26455 | . 2 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝐵) = 𝐵 ↔ 𝐴 = 𝐵)) |
37 | 35, 36 | mpbid 234 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1536 ∈ wcel 2113 ‘cfv 6358 (class class class)co 7159 Basecbs 16486 distcds 16577 TarskiGcstrkg 26219 Itvcitv 26225 LineGclng 26226 cgrGccgrg 26299 pInvGcmir 26441 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-int 4880 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-oadd 8109 df-er 8292 df-pm 8412 df-en 8513 df-dom 8514 df-sdom 8515 df-fin 8516 df-dju 9333 df-card 9371 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-nn 11642 df-2 11703 df-3 11704 df-n0 11901 df-xnn0 11971 df-z 11985 df-uz 12247 df-fz 12896 df-fzo 13037 df-hash 13694 df-word 13865 df-concat 13926 df-s1 13953 df-s2 14213 df-s3 14214 df-trkgc 26237 df-trkgb 26238 df-trkgcb 26239 df-trkg 26242 df-cgrg 26300 df-mir 26442 |
This theorem is referenced by: miduniq1 26475 krippenlem 26479 mideu 26527 opphllem3 26538 |
Copyright terms: Public domain | W3C validator |