| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > legov3 | Structured version Visualization version GIF version | ||
| Description: An equivalent definition of the less-than relationship, from the strict relation. (Contributed by Thierry Arnoux, 15-Dec-2019.) |
| Ref | Expression |
|---|---|
| legval.p | ⊢ 𝑃 = (Base‘𝐺) |
| legval.d | ⊢ − = (dist‘𝐺) |
| legval.i | ⊢ 𝐼 = (Itv‘𝐺) |
| legval.l | ⊢ ≤ = (≤G‘𝐺) |
| legval.g | ⊢ (𝜑 → 𝐺 ∈ TarskiG) |
| legso.a | ⊢ 𝐸 = ( − “ (𝑃 × 𝑃)) |
| legso.f | ⊢ (𝜑 → Fun − ) |
| legso.l | ⊢ < = (( ≤ ↾ 𝐸) ∖ I ) |
| legso.d | ⊢ (𝜑 → (𝑃 × 𝑃) ⊆ dom − ) |
| ltgov.a | ⊢ (𝜑 → 𝐴 ∈ 𝑃) |
| ltgov.b | ⊢ (𝜑 → 𝐵 ∈ 𝑃) |
| Ref | Expression |
|---|---|
| legov3 | ⊢ (𝜑 → ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ↔ ((𝐴 − 𝐵) < (𝐶 − 𝐷) ∨ (𝐴 − 𝐵) = (𝐶 − 𝐷)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | legval.p | . . . 4 ⊢ 𝑃 = (Base‘𝐺) | |
| 2 | legval.d | . . . 4 ⊢ − = (dist‘𝐺) | |
| 3 | legval.i | . . . 4 ⊢ 𝐼 = (Itv‘𝐺) | |
| 4 | legval.l | . . . 4 ⊢ ≤ = (≤G‘𝐺) | |
| 5 | legval.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ TarskiG) | |
| 6 | legso.a | . . . 4 ⊢ 𝐸 = ( − “ (𝑃 × 𝑃)) | |
| 7 | legso.f | . . . 4 ⊢ (𝜑 → Fun − ) | |
| 8 | legso.l | . . . 4 ⊢ < = (( ≤ ↾ 𝐸) ∖ I ) | |
| 9 | legso.d | . . . 4 ⊢ (𝜑 → (𝑃 × 𝑃) ⊆ dom − ) | |
| 10 | ltgov.a | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑃) | |
| 11 | ltgov.b | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑃) | |
| 12 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 | ltgov 29119 | . . 3 ⊢ (𝜑 → ((𝐴 − 𝐵) < (𝐶 − 𝐷) ↔ ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)))) |
| 13 | 12 | orbi1d 930 | . 2 ⊢ (𝜑 → (((𝐴 − 𝐵) < (𝐶 − 𝐷) ∨ (𝐴 − 𝐵) = (𝐶 − 𝐷)) ↔ (((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)) ∨ (𝐴 − 𝐵) = (𝐶 − 𝐷)))) |
| 14 | simprl 783 | . . . 4 ⊢ (((𝜑 ∧ (((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)) ∨ (𝐴 − 𝐵) = (𝐶 − 𝐷))) ∧ ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷))) → (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) | |
| 15 | 1, 2, 3, 4, 5, 10, 11 | legid 29109 | . . . . . . 7 ⊢ (𝜑 → (𝐴 − 𝐵) ≤ (𝐴 − 𝐵)) |
| 16 | 15 | adantr 486 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐴 − 𝐵) = (𝐶 − 𝐷)) → (𝐴 − 𝐵) ≤ (𝐴 − 𝐵)) |
| 17 | simpr 490 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐴 − 𝐵) = (𝐶 − 𝐷)) → (𝐴 − 𝐵) = (𝐶 − 𝐷)) | |
| 18 | 16, 17 | breqtrd 5136 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 − 𝐵) = (𝐶 − 𝐷)) → (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) |
| 19 | 18 | adantlr 728 | . . . 4 ⊢ (((𝜑 ∧ (((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)) ∨ (𝐴 − 𝐵) = (𝐶 − 𝐷))) ∧ (𝐴 − 𝐵) = (𝐶 − 𝐷)) → (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) |
| 20 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ (((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)) ∨ (𝐴 − 𝐵) = (𝐶 − 𝐷))) → (((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)) ∨ (𝐴 − 𝐵) = (𝐶 − 𝐷))) | |
| 21 | 14, 19, 20 | mpjaodan 973 | . . 3 ⊢ ((𝜑 ∧ (((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)) ∨ (𝐴 − 𝐵) = (𝐶 − 𝐷))) → (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) |
| 22 | simplr 781 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) ∧ ¬ (𝐴 − 𝐵) = (𝐶 − 𝐷)) → (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) | |
| 23 | simpr 490 | . . . . . . . 8 ⊢ (((𝜑 ∧ (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) ∧ ¬ (𝐴 − 𝐵) = (𝐶 − 𝐷)) → ¬ (𝐴 − 𝐵) = (𝐶 − 𝐷)) | |
| 24 | 23 | neqned 2969 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) ∧ ¬ (𝐴 − 𝐵) = (𝐶 − 𝐷)) → (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)) |
| 25 | 22, 24 | jca 521 | . . . . . 6 ⊢ (((𝜑 ∧ (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) ∧ ¬ (𝐴 − 𝐵) = (𝐶 − 𝐷)) → ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷))) |
| 26 | 25 | ex 418 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) → (¬ (𝐴 − 𝐵) = (𝐶 − 𝐷) → ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)))) |
| 27 | 26 | orrd 877 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) → ((𝐴 − 𝐵) = (𝐶 − 𝐷) ∨ ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)))) |
| 28 | 27 | orcomd 885 | . . 3 ⊢ ((𝜑 ∧ (𝐴 − 𝐵) ≤ (𝐶 − 𝐷)) → (((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)) ∨ (𝐴 − 𝐵) = (𝐶 − 𝐷))) |
| 29 | 21, 28 | impbida 813 | . 2 ⊢ (𝜑 → ((((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ∧ (𝐴 − 𝐵) ≠ (𝐶 − 𝐷)) ∨ (𝐴 − 𝐵) = (𝐶 − 𝐷)) ↔ (𝐴 − 𝐵) ≤ (𝐶 − 𝐷))) |
| 30 | 13, 29 | bitr2d 283 | 1 ⊢ (𝜑 → ((𝐴 − 𝐵) ≤ (𝐶 − 𝐷) ↔ ((𝐴 − 𝐵) < (𝐶 − 𝐷) ∨ (𝐴 − 𝐵) = (𝐶 − 𝐷)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ⊆ wss 3899 ∖ cdif 4047 class class class wbr 5107 I cid 5551 × cxp 5655 dom cdm 5657 ↾ cres 5659 “ cima 5660 Fun wfun 6559 ‘cfv 6565 (class class class)co 7450 Basecbs 17433 distcds 17483 TarskiGcstrkg 28948 Itvcitv 28954 ≤Gcleg 29104 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 ax-pre-mulgt0 11315 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4840 df-uni 4872 df-int 4912 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5552 df-eprel 5557 df-po 5565 df-so 5566 df-fr 5610 df-we 5612 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-pred 6329 df-ord 6390 df-on 6391 df-lim 6392 df-suc 6393 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7911 df-1st 8034 df-2nd 8035 df-frecs 8336 df-wrecs 8367 df-recs 8416 df-rdg 8455 df-1o 8513 df-oadd 8517 df-er 8754 df-pm 8887 df-en 9011 df-dom 9012 df-sdom 9013 df-fin 9014 df-dju 10018 df-card 10056 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-nn 12375 df-2 12444 df-3 12445 df-n0 12646 df-xnn0 12719 df-z 12733 df-uz 13005 df-fz 13679 df-fzo 13828 df-hash 14515 df-word 14699 df-concat 14756 df-s1 14783 df-s2 15040 df-s3 15041 df-trkgc 28969 df-trkgb 28970 df-trkgcb 28971 df-trkg 28974 df-cgrg 29033 df-leg 29105 |
| This theorem is used by: legso 29121 |
| Copyright terms: Public domain | W3C validator |