| 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 2736 | . . . 4 ⊢ (cgrG‘𝐺) = (cgrG‘𝐺) | |
| 9 | mirval.d | . . . . 5 ⊢ − = (dist‘𝐺) | |
| 10 | mirval.s | . . . . 5 ⊢ 𝑆 = (pInvG‘𝐺) | |
| 11 | miduniq.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 12 | eqid 2736 | . . . . 5 ⊢ (𝑆‘𝐴) = (𝑆‘𝐴) | |
| 13 | 1, 9, 3, 2, 10, 4, 11, 12, 7 | mircl 28729 | . . . 4 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) ∈ 𝑃) |
| 14 | eqid 2736 | . . . . . . 7 ⊢ (𝑆‘𝐵) = (𝑆‘𝐵) | |
| 15 | 1, 9, 3, 2, 10, 4, 7, 14, 5 | mirbtwn 28726 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ (((𝑆‘𝐵)‘𝑋)𝐼𝑋)) |
| 16 | miduniq.f | . . . . . . 7 ⊢ (𝜑 → ((𝑆‘𝐵)‘𝑋) = 𝑌) | |
| 17 | 16 | oveq1d 7382 | . . . . . 6 ⊢ (𝜑 → (((𝑆‘𝐵)‘𝑋)𝐼𝑋) = (𝑌𝐼𝑋)) |
| 18 | 15, 17 | eleqtrd 2838 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ (𝑌𝐼𝑋)) |
| 19 | 1, 9, 3, 4, 6, 7, 5, 18 | tgbtwncom 28556 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ (𝑋𝐼𝑌)) |
| 20 | 1, 9, 3, 2, 10, 4, 11, 12, 6, 7 | miriso 28738 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑌) − ((𝑆‘𝐴)‘𝐵)) = (𝑌 − 𝐵)) |
| 21 | miduniq.e | . . . . . . 7 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝑋) = 𝑌) | |
| 22 | 1, 9, 3, 2, 10, 4, 11, 12, 5, 21 | mircom 28731 | . . . . . 6 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝑌) = 𝑋) |
| 23 | 22 | oveq1d 7382 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑌) − ((𝑆‘𝐴)‘𝐵)) = (𝑋 − ((𝑆‘𝐴)‘𝐵))) |
| 24 | 1, 9, 3, 2, 10, 4, 7, 14, 5 | mircgr 28725 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 − ((𝑆‘𝐵)‘𝑋)) = (𝐵 − 𝑋)) |
| 25 | 16 | oveq2d 7383 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 − ((𝑆‘𝐵)‘𝑋)) = (𝐵 − 𝑌)) |
| 26 | 24, 25 | eqtr3d 2773 | . . . . . . 7 ⊢ (𝜑 → (𝐵 − 𝑋) = (𝐵 − 𝑌)) |
| 27 | 26 | eqcomd 2742 | . . . . . 6 ⊢ (𝜑 → (𝐵 − 𝑌) = (𝐵 − 𝑋)) |
| 28 | 1, 9, 3, 4, 7, 6, 7, 5, 27 | tgcgrcomlr 28548 | . . . . 5 ⊢ (𝜑 → (𝑌 − 𝐵) = (𝑋 − 𝐵)) |
| 29 | 20, 23, 28 | 3eqtr3rd 2780 | . . . 4 ⊢ (𝜑 → (𝑋 − 𝐵) = (𝑋 − ((𝑆‘𝐴)‘𝐵))) |
| 30 | 1, 9, 3, 2, 10, 4, 11, 12, 5, 7 | miriso 28738 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑋) − ((𝑆‘𝐴)‘𝐵)) = (𝑋 − 𝐵)) |
| 31 | 21 | oveq1d 7382 | . . . . 5 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝑋) − ((𝑆‘𝐴)‘𝐵)) = (𝑌 − ((𝑆‘𝐴)‘𝐵))) |
| 32 | 1, 9, 3, 4, 7, 5, 7, 6, 26 | tgcgrcomlr 28548 | . . . . 5 ⊢ (𝜑 → (𝑋 − 𝐵) = (𝑌 − 𝐵)) |
| 33 | 30, 31, 32 | 3eqtr3rd 2780 | . . . 4 ⊢ (𝜑 → (𝑌 − 𝐵) = (𝑌 − ((𝑆‘𝐴)‘𝐵))) |
| 34 | 1, 2, 3, 4, 5, 6, 7, 8, 13, 11, 9, 19, 29, 33 | tgidinside 28639 | . . 3 ⊢ (𝜑 → 𝐵 = ((𝑆‘𝐴)‘𝐵)) |
| 35 | 34 | eqcomd 2742 | . 2 ⊢ (𝜑 → ((𝑆‘𝐴)‘𝐵) = 𝐵) |
| 36 | 1, 9, 3, 2, 10, 4, 11, 12, 7 | mirinv 28734 | . 2 ⊢ (𝜑 → (((𝑆‘𝐴)‘𝐵) = 𝐵 ↔ 𝐴 = 𝐵)) |
| 37 | 35, 36 | mpbid 232 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 distcds 17229 TarskiGcstrkg 28495 Itvcitv 28501 LineGclng 28502 cgrGccgrg 28578 pInvGcmir 28720 |
| 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 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-oadd 8409 df-er 8643 df-pm 8776 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-dju 9825 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-xnn0 12511 df-z 12525 df-uz 12789 df-fz 13462 df-fzo 13609 df-hash 14293 df-word 14476 df-concat 14533 df-s1 14559 df-s2 14810 df-s3 14811 df-trkgc 28516 df-trkgb 28517 df-trkgcb 28518 df-trkg 28521 df-cgrg 28579 df-mir 28721 |
| This theorem is referenced by: miduniq1 28754 krippenlem 28758 mideu 28806 opphllem3 28817 |
| Copyright terms: Public domain | W3C validator |