| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > leord2 | Structured version Visualization version GIF version | ||
| Description: Infer an ordering relation from a proof in only one direction. (Contributed by Mario Carneiro, 14-Jun-2014.) |
| Ref | Expression |
|---|---|
| ltord.1 | ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵) |
| ltord.2 | ⊢ (𝑥 = 𝐶 → 𝐴 = 𝑀) |
| ltord.3 | ⊢ (𝑥 = 𝐷 → 𝐴 = 𝑁) |
| ltord.4 | ⊢ 𝑆 ⊆ ℝ |
| ltord.5 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ℝ) |
| ltord2.6 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 < 𝑦 → 𝐵 < 𝐴)) |
| Ref | Expression |
|---|---|
| leord2 | ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 ≤ 𝐷 ↔ 𝑁 ≤ 𝑀)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltord.1 | . . . 4 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵) | |
| 2 | 1 | negeqd 11590 | . . 3 ⊢ (𝑥 = 𝑦 → -𝐴 = -𝐵) |
| 3 | ltord.2 | . . . 4 ⊢ (𝑥 = 𝐶 → 𝐴 = 𝑀) | |
| 4 | 3 | negeqd 11590 | . . 3 ⊢ (𝑥 = 𝐶 → -𝐴 = -𝑀) |
| 5 | ltord.3 | . . . 4 ⊢ (𝑥 = 𝐷 → 𝐴 = 𝑁) | |
| 6 | 5 | negeqd 11590 | . . 3 ⊢ (𝑥 = 𝐷 → -𝐴 = -𝑁) |
| 7 | ltord.4 | . . 3 ⊢ 𝑆 ⊆ ℝ | |
| 8 | ltord.5 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ℝ) | |
| 9 | 8 | renegcld 11782 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → -𝐴 ∈ ℝ) |
| 10 | ltord2.6 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 < 𝑦 → 𝐵 < 𝐴)) | |
| 11 | 8 | ralrimiva 3158 | . . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ) |
| 12 | 1 | eleq1d 2849 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝐴 ∈ ℝ ↔ 𝐵 ∈ ℝ)) |
| 13 | 12 | rspccva 3579 | . . . . . . 7 ⊢ ((∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ ∧ 𝑦 ∈ 𝑆) → 𝐵 ∈ ℝ) |
| 14 | 11, 13 | sylan 592 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝑆) → 𝐵 ∈ ℝ) |
| 15 | 14 | adantrl 729 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝐵 ∈ ℝ) |
| 16 | 8 | adantrr 730 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → 𝐴 ∈ ℝ) |
| 17 | ltneg 11856 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝐵 < 𝐴 ↔ -𝐴 < -𝐵)) | |
| 18 | 15, 16, 17 | syl2anc 596 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝐵 < 𝐴 ↔ -𝐴 < -𝐵)) |
| 19 | 10, 18 | sylibd 242 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 < 𝑦 → -𝐴 < -𝐵)) |
| 20 | 2, 4, 6, 7, 9, 19 | leord1 11883 | . 2 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 ≤ 𝐷 ↔ -𝑀 ≤ -𝑁)) |
| 21 | 5 | eleq1d 2849 | . . . . . 6 ⊢ (𝑥 = 𝐷 → (𝐴 ∈ ℝ ↔ 𝑁 ∈ ℝ)) |
| 22 | 21 | rspccva 3579 | . . . . 5 ⊢ ((∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ ∧ 𝐷 ∈ 𝑆) → 𝑁 ∈ ℝ) |
| 23 | 11, 22 | sylan 592 | . . . 4 ⊢ ((𝜑 ∧ 𝐷 ∈ 𝑆) → 𝑁 ∈ ℝ) |
| 24 | 23 | adantrl 729 | . . 3 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝑁 ∈ ℝ) |
| 25 | 3 | eleq1d 2849 | . . . . . 6 ⊢ (𝑥 = 𝐶 → (𝐴 ∈ ℝ ↔ 𝑀 ∈ ℝ)) |
| 26 | 25 | rspccva 3579 | . . . . 5 ⊢ ((∀𝑥 ∈ 𝑆 𝐴 ∈ ℝ ∧ 𝐶 ∈ 𝑆) → 𝑀 ∈ ℝ) |
| 27 | 11, 26 | sylan 592 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝑆) → 𝑀 ∈ ℝ) |
| 28 | 27 | adantrr 730 | . . 3 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → 𝑀 ∈ ℝ) |
| 29 | leneg 11859 | . . 3 ⊢ ((𝑁 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝑁 ≤ 𝑀 ↔ -𝑀 ≤ -𝑁)) | |
| 30 | 24, 28, 29 | syl2anc 596 | . 2 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝑁 ≤ 𝑀 ↔ -𝑀 ≤ -𝑁)) |
| 31 | 20, 30 | bitr4d 285 | 1 ⊢ ((𝜑 ∧ (𝐶 ∈ 𝑆 ∧ 𝐷 ∈ 𝑆)) → (𝐶 ≤ 𝐷 ↔ 𝑁 ≤ 𝑀)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 ⊆ wss 3900 class class class wbr 5108 ℝcr 11238 < clt 11382 ≤ cle 11383 -cneg 11581 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-po 5566 df-so 5567 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |