| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > leg0 | Structured version Visualization version GIF version | ||
| Description: Degenerated (zero-length) segments are minimal. Proposition 5.11 of [Schwabhauser] p. 42. (Contributed by Thierry Arnoux, 27-Jun-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 | ⊢ (𝜑 → 𝐷 ∈ 𝑃) |
| Ref | Expression |
|---|---|
| leg0 | ⊢ (𝜑 → (𝐴 − 𝐴) ≤ (𝐶 − 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | legtrd.c | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑃) | |
| 2 | legval.p | . . . 4 ⊢ 𝑃 = (Base‘𝐺) | |
| 3 | legval.d | . . . 4 ⊢ − = (dist‘𝐺) | |
| 4 | legval.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
| 5 | legval.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 6 | legtrd.d | . . . 4 ⊢ (𝜑 → 𝐷 ∈ 𝑃) | |
| 7 | 2, 3, 4, 5, 1, 6 | tgbtwntriv1 28489 | . . 3 ⊢ (𝜑 → 𝐶 ∈ (𝐶𝐼𝐷)) |
| 8 | legid.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 9 | 2, 3, 4, 5, 8, 1 | tgcgrtriv 28482 | . . 3 ⊢ (𝜑 → (𝐴 − 𝐴) = (𝐶 − 𝐶)) |
| 10 | eleq1 2821 | . . . . 5 ⊢ (𝑥 = 𝐶 → (𝑥 ∈ (𝐶𝐼𝐷) ↔ 𝐶 ∈ (𝐶𝐼𝐷))) | |
| 11 | oveq2 7363 | . . . . . 6 ⊢ (𝑥 = 𝐶 → (𝐶 − 𝑥) = (𝐶 − 𝐶)) | |
| 12 | 11 | eqeq2d 2744 | . . . . 5 ⊢ (𝑥 = 𝐶 → ((𝐴 − 𝐴) = (𝐶 − 𝑥) ↔ (𝐴 − 𝐴) = (𝐶 − 𝐶))) |
| 13 | 10, 12 | anbi12d 632 | . . . 4 ⊢ (𝑥 = 𝐶 → ((𝑥 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝑥)) ↔ (𝐶 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝐶)))) |
| 14 | 13 | rspcev 3573 | . . 3 ⊢ ((𝐶 ∈ 𝑃 ∧ (𝐶 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝐶))) → ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝑥))) |
| 15 | 1, 7, 9, 14 | syl12anc 836 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝑥))) |
| 16 | legval.l | . . 3 ⊢ ≤ = (≤G‘𝐺) | |
| 17 | 2, 3, 4, 16, 5, 8, 8, 1, 6 | legov 28583 | . 2 ⊢ (𝜑 → ((𝐴 − 𝐴) ≤ (𝐶 − 𝐷) ↔ ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝑥)))) |
| 18 | 15, 17 | mpbird 257 | 1 ⊢ (𝜑 → (𝐴 − 𝐴) ≤ (𝐶 − 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∃wrex 3057 class class class wbr 5095 ‘cfv 6489 (class class class)co 7355 Basecbs 17127 distcds 17177 TarskiGcstrkg 28425 Itvcitv 28431 ≤Gcleg 28580 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11073 ax-resscn 11074 ax-1cn 11075 ax-icn 11076 ax-addcl 11077 ax-addrcl 11078 ax-mulcl 11079 ax-mulrcl 11080 ax-mulcom 11081 ax-addass 11082 ax-mulass 11083 ax-distr 11084 ax-i2m1 11085 ax-1ne0 11086 ax-1rid 11087 ax-rnegex 11088 ax-rrecex 11089 ax-cnre 11090 ax-pre-lttri 11091 ax-pre-lttrn 11092 ax-pre-ltadd 11093 ax-pre-mulgt0 11094 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-tp 4582 df-op 4584 df-uni 4861 df-int 4900 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-1st 7930 df-2nd 7931 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-oadd 8398 df-er 8631 df-pm 8762 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-dju 9805 df-card 9843 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 df-sub 11357 df-neg 11358 df-nn 12137 df-2 12199 df-3 12200 df-n0 12393 df-xnn0 12466 df-z 12480 df-uz 12743 df-fz 13415 df-fzo 13562 df-hash 14245 df-word 14428 df-concat 14485 df-s1 14511 df-s2 14762 df-s3 14763 df-trkgc 28446 df-trkgb 28447 df-trkgcb 28448 df-trkg 28451 df-cgrg 28509 df-leg 28581 |
| This theorem is referenced by: legeq 28591 |
| Copyright terms: Public domain | W3C validator |