| 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 28536 | . . 3 ⊢ (𝜑 → (𝐶 − 𝐶) ≤ (𝐴 − 𝐵)) |
| 11 | 1, 2, 3, 8, 4, 5, 6, 7, 7, 9, 10 | legtri3 28534 | . 2 ⊢ (𝜑 → (𝐴 − 𝐵) = (𝐶 − 𝐶)) |
| 12 | 1, 2, 3, 4, 5, 6, 7, 11 | axtgcgrid 28407 | 1 ⊢ (𝜑 → 𝐴 = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2107 class class class wbr 5123 ‘cfv 6541 (class class class)co 7413 Basecbs 17229 distcds 17282 TarskiGcstrkg 28371 Itvcitv 28377 ≤Gcleg 28526 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-rep 5259 ax-sep 5276 ax-nul 5286 ax-pow 5345 ax-pr 5412 ax-un 7737 ax-cnex 11193 ax-resscn 11194 ax-1cn 11195 ax-icn 11196 ax-addcl 11197 ax-addrcl 11198 ax-mulcl 11199 ax-mulrcl 11200 ax-mulcom 11201 ax-addass 11202 ax-mulass 11203 ax-distr 11204 ax-i2m1 11205 ax-1ne0 11206 ax-1rid 11207 ax-rnegex 11208 ax-rrecex 11209 ax-cnre 11210 ax-pre-lttri 11211 ax-pre-lttrn 11212 ax-pre-ltadd 11213 ax-pre-mulgt0 11214 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-reu 3364 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-tp 4611 df-op 4613 df-uni 4888 df-int 4927 df-iun 4973 df-br 5124 df-opab 5186 df-mpt 5206 df-tr 5240 df-id 5558 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-pred 6301 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7870 df-1st 7996 df-2nd 7997 df-frecs 8288 df-wrecs 8319 df-recs 8393 df-rdg 8432 df-1o 8488 df-oadd 8492 df-er 8727 df-pm 8851 df-en 8968 df-dom 8969 df-sdom 8970 df-fin 8971 df-dju 9923 df-card 9961 df-pnf 11279 df-mnf 11280 df-xr 11281 df-ltxr 11282 df-le 11283 df-sub 11476 df-neg 11477 df-nn 12249 df-2 12311 df-3 12312 df-n0 12510 df-xnn0 12583 df-z 12597 df-uz 12861 df-fz 13530 df-fzo 13677 df-hash 14352 df-word 14535 df-concat 14591 df-s1 14616 df-s2 14869 df-s3 14870 df-trkgc 28392 df-trkgb 28393 df-trkgcb 28394 df-trkg 28397 df-cgrg 28455 df-leg 28527 |
| This theorem is referenced by: krippenlem 28634 |
| Copyright terms: Public domain | W3C validator |