| 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 28811 | . . 3 ⊢ (𝜑 → 𝐶 ∈ (𝐶𝐼𝐷)) |
| 8 | legid.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 9 | 2, 3, 4, 5, 8, 1 | tgcgrtriv 28804 | . . 3 ⊢ (𝜑 → (𝐴 − 𝐴) = (𝐶 − 𝐶)) |
| 10 | eleq1 2853 | . . . . 5 ⊢ (𝑥 = 𝐶 → (𝑥 ∈ (𝐶𝐼𝐷) ↔ 𝐶 ∈ (𝐶𝐼𝐷))) | |
| 11 | oveq2 7427 | . . . . . 6 ⊢ (𝑥 = 𝐶 → (𝐶 − 𝑥) = (𝐶 − 𝐶)) | |
| 12 | 11 | eqeq2d 2776 | . . . . 5 ⊢ (𝑥 = 𝐶 → ((𝐴 − 𝐴) = (𝐶 − 𝑥) ↔ (𝐴 − 𝐴) = (𝐶 − 𝐶))) |
| 13 | 10, 12 | anbi12d 644 | . . . 4 ⊢ (𝑥 = 𝐶 → ((𝑥 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝑥)) ↔ (𝐶 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝐶)))) |
| 14 | 13 | rspcev 3583 | . . 3 ⊢ ((𝐶 ∈ 𝑃 ∧ (𝐶 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝐶))) → ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝑥))) |
| 15 | 1, 7, 9, 14 | syl12anc 850 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝑥))) |
| 16 | legval.l | . . 3 ⊢ ≤ = (≤G‘𝐺) | |
| 17 | 2, 3, 4, 16, 5, 8, 8, 1, 6 | legov 28905 | . 2 ⊢ (𝜑 → ((𝐴 − 𝐴) ≤ (𝐶 − 𝐷) ↔ ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝑥)))) |
| 18 | 15, 17 | mpbird 260 | 1 ⊢ (𝜑 → (𝐴 − 𝐴) ≤ (𝐶 − 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 class class class wbr 5111 ‘cfv 6540 (class class class)co 7419 Basecbs 17291 distcds 17341 TarskiGcstrkg 28747 Itvcitv 28753 ≤Gcleg 28902 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11171 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-oadd 8463 df-er 8700 df-pm 8833 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-dju 9903 df-card 9941 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 df-nn 12249 df-2 12318 df-3 12319 df-n0 12520 df-xnn0 12593 df-z 12607 df-uz 12879 df-fz 13552 df-fzo 13700 df-hash 14385 df-word 14569 df-concat 14626 df-s1 14653 df-s2 14909 df-s3 14910 df-trkgc 28768 df-trkgb 28769 df-trkgcb 28770 df-trkg 28773 df-cgrg 28831 df-leg 28903 |
| This theorem is used by: legeq 28913 |
| Copyright terms: Public domain | W3C validator |