| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > legeq | Structured version Visualization version GIF version | ||
| Description: Deduce equality from "less than" null segments. (Contributed by Thierry Arnoux, 12-Aug-2019.) |
| Ref | Expression |
|---|---|
| legval.p | ⊢ 𝑃 = (Base‘𝐺) |
| legval.d | ⊢ − = (dist‘𝐺) |
| legval.i | ⊢ 𝐼 = (Itv‘𝐺) |
| legval.l | ⊢ ≤ = (≤G‘𝐺) |
| legval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| legid.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| legid.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| legtrd.c | ⊢ (𝜑 → 𝐶 ∈ 𝑃) |
| legtrd.d | ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
| legeq.1 | ⊢ (𝜑 → (𝐴 − 𝐵) ≤ (𝐶 − 𝐶)) |
| Ref | Expression |
|---|---|
| legeq | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | legval.p | . 2 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | legval.d | . 2 ⊢ − = (dist‘𝐺) | |
| 3 | legval.i | . 2 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | legval.g | . 2 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 5 | legid.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 6 | legid.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 7 | legtrd.c | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 8 | legval.l | . . 3 ⊢ ≤ = (≤G‘𝐺) | |
| 9 | legeq.1 | . . 3 ⊢ (𝜑 → (𝐴 − 𝐵) ≤ (𝐶 − 𝐶)) | |
| 10 | 1, 2, 3, 8, 4, 7, 5, 5, 6 | leg0 29061 | . . 3 ⊢ (𝜑 → (𝐶 − 𝐶) ≤ (𝐴 − 𝐵)) |
| 11 | 1, 2, 3, 8, 4, 5, 6, 7, 7, 9, 10 | legtri3 29059 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐶 − 𝐶)) |
| 12 | 1, 2, 3, 4, 5, 6, 7, 11 | axtgcgrid 28931 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 class class class wbr 5102 ‘cfv 6539 (class class class)co 7421 Basecbs 17393 distcds 17443 TarskiGcstrkg 28895 Itvcitv 28901 ≤Gcleg 29051 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-1o 8480 df-oadd 8484 df-er 8721 df-pm 8854 df-en 8978 df-dom 8979 df-sdom 8980 df-fin 8981 df-dju 9986 df-card 10024 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-nn 12340 df-2 12409 df-3 12410 df-n0 12611 df-xnn0 12684 df-z 12698 df-uz 12970 df-fz 13644 df-fzo 13793 df-hash 14479 df-word 14663 df-concat 14720 df-s1 14747 df-s2 15004 df-s3 15005 df-trkgc 28916 df-trkgb 28917 df-trkgcb 28918 df-trkg 28921 df-cgrg 28980 df-leg 29052 |
| This theorem is used by: krippenlem 29168 |
| Copyright terms: Public domain | W3C validator |