| 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 1213 | . . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → 𝐴 ∈ ℝ) | |
| 2 | 1 | leidd 11720 | . . 3 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → 𝐴 ≤ 𝐴) |
| 3 | iftrue 4490 | . . . 4 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
| 4 | 3 | adantl 481 | . . 3 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → if(𝜑, 𝐴, 𝐵) = 𝐴) |
| 5 | id 22 | . . . . . 6 ⊢ ((𝜑 → 𝜓) → (𝜑 → 𝜓)) | |
| 6 | 5 | imp 406 | . . . . 5 ⊢ (((𝜑 → 𝜓) ∧ 𝜑) → 𝜓) |
| 7 | 6 | adantll 714 | . . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → 𝜓) |
| 8 | 7 | iftrued 4492 | . . 3 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → if(𝜓, 𝐴, 𝐵) = 𝐴) |
| 9 | 2, 4, 8 | 3brtr4d 5134 | . 2 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ 𝜑) → if(𝜑, 𝐴, 𝐵) ≤ if(𝜓, 𝐴, 𝐵)) |
| 10 | iffalse 4493 | . . . 4 ⊢ (¬ 𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
| 11 | 10 | adantl 481 | . . 3 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → if(𝜑, 𝐴, 𝐵) = 𝐵) |
| 12 | simpll3 1215 | . . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → 𝐵 ≤ 𝐴) | |
| 13 | simpll2 1214 | . . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → 𝐵 ∈ ℝ) | |
| 14 | 13 | leidd 11720 | . . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → 𝐵 ≤ 𝐵) |
| 15 | breq2 5106 | . . . . 5 ⊢ (𝐴 = if(𝜓, 𝐴, 𝐵) → (𝐵 ≤ 𝐴 ↔ 𝐵 ≤ if(𝜓, 𝐴, 𝐵))) | |
| 16 | breq2 5106 | . . . . 5 ⊢ (𝐵 = if(𝜓, 𝐴, 𝐵) → (𝐵 ≤ 𝐵 ↔ 𝐵 ≤ if(𝜓, 𝐴, 𝐵))) | |
| 17 | 15, 16 | ifboth 4524 | . . . 4 ⊢ ((𝐵 ≤ 𝐴 ∧ 𝐵 ≤ 𝐵) → 𝐵 ≤ if(𝜓, 𝐴, 𝐵)) |
| 18 | 12, 14, 17 | syl2anc 584 | . . 3 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → 𝐵 ≤ if(𝜓, 𝐴, 𝐵)) |
| 19 | 11, 18 | eqbrtrd 5124 | . 2 ⊢ ((((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) ∧ ¬ 𝜑) → if(𝜑, 𝐴, 𝐵) ≤ if(𝜓, 𝐴, 𝐵)) |
| 20 | 9, 19 | pm2.61dan 812 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐵 ≤ 𝐴) ∧ (𝜑 → 𝜓)) → if(𝜑, 𝐴, 𝐵) ≤ if(𝜓, 𝐴, 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ifcif 4484 class class class wbr 5102 ℝcr 11043 ≤ cle 11185 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-resscn 11101 ax-pre-lttri 11118 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-er 8648 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 |
| This theorem is referenced by: rpnnen2lem4 16161 itg2cnlem2 25639 |
| Copyright terms: Public domain | W3C validator |