| 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 28731 | . . 3 ⊢ (𝜑 → (𝐶 − 𝐶) ≤ (𝐴 − 𝐵)) |
| 11 | 1, 2, 3, 8, 4, 5, 6, 7, 7, 9, 10 | legtri3 28729 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐶 − 𝐶)) |
| 12 | 1, 2, 3, 4, 5, 6, 7, 11 | axtgcgrid 28602 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1554 ∈ wcel 2136 class class class wbr 5094 ‘cfv 6510 (class class class)co 7385 Basecbs 17221 distcds 17271 TarskiGcstrkg 28566 Itvcitv 28572 ≤Gcleg 28721 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-rep 5221 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-mulrcl 11126 ax-mulcom 11127 ax-addass 11128 ax-mulass 11129 ax-distr 11130 ax-i2m1 11131 ax-1ne0 11132 ax-1rid 11133 ax-rnegex 11134 ax-rrecex 11135 ax-cnre 11136 ax-pre-lttri 11137 ax-pre-lttrn 11138 ax-pre-ltadd 11139 ax-pre-mulgt0 11140 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-reu 3362 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-tp 4581 df-op 4583 df-uni 4860 df-int 4900 df-iun 4945 df-br 5095 df-opab 5157 df-mpt 5176 df-tr 5202 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 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-riota 7342 df-ov 7388 df-oprab 7389 df-mpo 7390 df-om 7836 df-1st 7959 df-2nd 7960 df-frecs 8250 df-wrecs 8281 df-recs 8330 df-rdg 8369 df-1o 8425 df-oadd 8429 df-er 8666 df-pm 8799 df-en 8917 df-dom 8918 df-sdom 8919 df-fin 8920 df-dju 9849 df-card 9887 df-pnf 11208 df-mnf 11209 df-xr 11210 df-ltxr 11211 df-le 11212 df-sub 11406 df-neg 11407 df-nn 12201 df-2 12270 df-3 12271 df-n0 12472 df-xnn0 12545 df-z 12559 df-uz 12830 df-fz 13503 df-fzo 13650 df-hash 14334 df-word 14517 df-concat 14574 df-s1 14600 df-s2 14851 df-s3 14852 df-trkgc 28587 df-trkgb 28588 df-trkgcb 28589 df-trkg 28592 df-cgrg 28650 df-leg 28722 |
| This theorem is referenced by: krippenlem 28829 |
| Copyright terms: Public domain | W3C validator |