| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ibllem | Structured version Visualization version GIF version | ||
| Description: Conditioned equality theorem for the if statement. (Contributed by Mario Carneiro, 31-Jul-2014.) |
| Ref | Expression |
|---|---|
| ibllem.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| ibllem | ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ibllem.1 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) | |
| 2 | 1 | breq2d 5125 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (0 ≤ 𝐵 ↔ 0 ≤ 𝐶)) |
| 3 | 2 | pm5.32da 589 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶))) |
| 4 | 3 | ifbid 4516 | . 2 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐵, 0)) |
| 5 | 1 | adantrr 729 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶)) → 𝐵 = 𝐶) |
| 6 | 5 | ifeq1da 4524 | . 2 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐵, 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)) |
| 7 | 4, 6 | eqtrd 2804 | 1 ⊢ (𝜑 → if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐵), 𝐵, 0) = if((𝑥 ∈ 𝐴 ∧ 0 ≤ 𝐶), 𝐶, 0)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ifcif 4492 class class class wbr 5113 0cc0 11100 ≤ cle 11244 |
| 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-ext 2741 |
| 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-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5114 |
| This theorem is referenced by: isibl 25893 isibl2 25894 iblitg 25896 iblcnlem1 25916 iblcnlem 25917 itgcnlem 25918 iblrelem 25919 itgrevallem1 25923 itgeqa 25942 |
| Copyright terms: Public domain | W3C validator |