| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ifle | Structured version Visualization version GIF version | ||
| Description: An if statement transforms an implication into an inequality of terms. (Contributed by Mario Carneiro, 31-Aug-2014.) |
| Ref | Expression |
|---|---|
| ifle | ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) → if(𝜑, 𝐴, 𝐵) ≤ if(𝜓, 𝐴, 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpll1 1229 | . . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → 𝐴 ∈ ℝ) | |
| 2 | 1 | leidd 11779 | . . 3 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → 𝐴 ≤ 𝐴) |
| 3 | iftrue 4498 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
| 4 | 3 | adantl 486 | . . 3 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → if(𝜑, 𝐴, 𝐵) = 𝐴) |
| 5 | id 23 | . . . . . 6 ⊢ ((𝜑 → 𝜓) → (𝜑 → 𝜓)) | |
| 6 | 5 | imp 411 | . . . . 5 ⊢ (((𝜑 → 𝜓) ∧ 𝜑) → 𝜓) |
| 7 | 6 | adantll 726 | . . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → 𝜓) |
| 8 | 7 | iftrued 4500 | . . 3 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → if(𝜓, 𝐴, 𝐵) = 𝐴) |
| 9 | 2, 4, 8 | 3brtr4d 5147 | . 2 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → if(𝜑, 𝐴, 𝐵) ≤ if(𝜓, 𝐴, 𝐵)) |
| 10 | iffalse 4501 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
| 11 | 10 | adantl 486 | . . 3 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → if(𝜑, 𝐴, 𝐵) = 𝐵) |
| 12 | simpll3 1231 | . . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → 𝐵 ≤ 𝐴) | |
| 13 | simpll2 1230 | . . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → 𝐵 ∈ ℝ) | |
| 14 | 13 | leidd 11779 | . . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → 𝐵 ≤ 𝐵) |
| 15 | breq2 5117 | . . . . 5 ⊢ (𝐴 = if(𝜓, 𝐴, 𝐵) → (𝐵 ≤ 𝐴 ↔ 𝐵 ≤ if(𝜓, 𝐴, 𝐵))) | |
| 16 | breq2 5117 | . . . . 5 ⊢ (𝐵 = if(𝜓, 𝐴, 𝐵) → (𝐵 ≤ 𝐵 ↔ 𝐵 ≤ if(𝜓, 𝐴, 𝐵))) | |
| 17 | 15, 16 | ifboth 4532 | . . . 4 ⊢ ((𝐵 ≤ 𝐴 ∧ 𝐵 ≤ 𝐵) → 𝐵 ≤ if(𝜓, 𝐴, 𝐵)) |
| 18 | 12, 14, 17 | syl2anc 595 | . . 3 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → 𝐵 ≤ if(𝜓, 𝐴, 𝐵)) |
| 19 | 11, 18 | eqbrtrd 5137 | . 2 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → if(𝜑, 𝐴, 𝐵) ≤ if(𝜓, 𝐴, 𝐵)) |
| 20 | 9, 19 | pm2.61dan 824 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) → if(𝜑, 𝐴, 𝐵) ≤ if(𝜓, 𝐴, 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ifcif 4492 class class class wbr 5113 ℝcr 11098 ≤ cle 11243 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-resscn 11156 ax-pre-lttri 11173 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-er 8693 df-en 8943 df-dom 8944 df-sdom 8945 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 |
| This theorem is referenced by: rpnnen2lem4 16272 itg2cnlem2 25889 |
| Copyright terms: Public domain | W3C validator |