| 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 28963 | . . 3 ⊢ (𝜑 → 𝐶 ∈ (𝐶𝐼𝐷)) |
| 8 | legid.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 9 | 2, 3, 4, 5, 8, 1 | tgcgrtriv 28955 | . . 3 ⊢ (𝜑 → (𝐴 − 𝐴) = (𝐶 − 𝐶)) |
| 10 | eleq1 2848 | . . . . 5 ⊢ (𝑥 = 𝐶 → (𝑥 ∈ (𝐶𝐼𝐷) ↔ 𝐶 ∈ (𝐶𝐼𝐷))) | |
| 11 | oveq2 7432 | . . . . . 6 ⊢ (𝑥 = 𝐶 → (𝐶 − 𝑥) = (𝐶 − 𝐶)) | |
| 12 | 11 | eqeq2d 2771 | . . . . 5 ⊢ (𝑥 = 𝐶 → ((𝐴 − 𝐴) = (𝐶 − 𝑥) ↔ (𝐴 − 𝐴) = (𝐶 − 𝐶))) |
| 13 | 10, 12 | anbi12d 644 | . . . 4 ⊢ (𝑥 = 𝐶 → ((𝑥 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝑥)) ↔ (𝐶 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝐶)))) |
| 14 | 13 | rspcev 3576 | . . 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 29057 | . 2 ⊢ (𝜑 → ((𝐴 − 𝐴) ≤ (𝐶 − 𝐷) ↔ ∃𝑥 ∈ 𝑃 (𝑥 ∈ (𝐶𝐼𝐷) ∧ (𝐴 − 𝐴) = (𝐶 − 𝑥)))) |
| 18 | 15, 17 | mpbird 260 | 1 ⊢ (𝜑 → (𝐴 − 𝐴) ≤ (𝐶 − 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 class class class wbr 5102 ‘cfv 6543 (class class class)co 7424 Basecbs 17396 distcds 17446 TarskiGcstrkg 28898 Itvcitv 28904 ≤Gcleg 29054 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-1o 8484 df-oadd 8488 df-er 8725 df-pm 8858 df-en 8982 df-dom 8983 df-sdom 8984 df-fin 8985 df-dju 9989 df-card 10027 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-2 12412 df-3 12413 df-n0 12614 df-xnn0 12687 df-z 12701 df-uz 12973 df-fz 13647 df-fzo 13796 df-hash 14482 df-word 14666 df-concat 14723 df-s1 14750 df-s2 15007 df-s3 15008 df-trkgc 28919 df-trkgb 28920 df-trkgcb 28921 df-trkg 28924 df-cgrg 28983 df-leg 29055 |
| This theorem is used by: legeq 29065 |
| Copyright terms: Public domain | W3C validator |