| 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 28525 | . . 3 ⊢ (𝜑 → (𝐶 − 𝐶) ≤ (𝐴 − 𝐵)) |
| 11 | 1, 2, 3, 8, 4, 5, 6, 7, 7, 9, 10 | legtri3 28523 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐶 − 𝐶)) |
| 12 | 1, 2, 3, 4, 5, 6, 7, 11 | axtgcgrid 28396 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 class class class wbr 5109 ‘cfv 6513 (class class class)co 7389 Basecbs 17185 distcds 17235 TarskiGcstrkg 28360 Itvcitv 28366 ≤Gcleg 28515 |
| 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 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5236 ax-sep 5253 ax-nul 5263 ax-pow 5322 ax-pr 5389 ax-un 7713 ax-cnex 11130 ax-resscn 11131 ax-1cn 11132 ax-icn 11133 ax-addcl 11134 ax-addrcl 11135 ax-mulcl 11136 ax-mulrcl 11137 ax-mulcom 11138 ax-addass 11139 ax-mulass 11140 ax-distr 11141 ax-i2m1 11142 ax-1ne0 11143 ax-1rid 11144 ax-rnegex 11145 ax-rrecex 11146 ax-cnre 11147 ax-pre-lttri 11148 ax-pre-lttrn 11149 ax-pre-ltadd 11150 ax-pre-mulgt0 11151 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-pss 3936 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4874 df-int 4913 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5535 df-eprel 5540 df-po 5548 df-so 5549 df-fr 5593 df-we 5595 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-pred 6276 df-ord 6337 df-on 6338 df-lim 6339 df-suc 6340 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-riota 7346 df-ov 7392 df-oprab 7393 df-mpo 7394 df-om 7845 df-1st 7970 df-2nd 7971 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8380 df-1o 8436 df-oadd 8440 df-er 8673 df-pm 8804 df-en 8921 df-dom 8922 df-sdom 8923 df-fin 8924 df-dju 9860 df-card 9898 df-pnf 11216 df-mnf 11217 df-xr 11218 df-ltxr 11219 df-le 11220 df-sub 11413 df-neg 11414 df-nn 12188 df-2 12250 df-3 12251 df-n0 12449 df-xnn0 12522 df-z 12536 df-uz 12800 df-fz 13475 df-fzo 13622 df-hash 14302 df-word 14485 df-concat 14542 df-s1 14567 df-s2 14820 df-s3 14821 df-trkgc 28381 df-trkgb 28382 df-trkgcb 28383 df-trkg 28386 df-cgrg 28444 df-leg 28516 |
| This theorem is referenced by: krippenlem 28623 |
| Copyright terms: Public domain | W3C validator |