| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ifeq1da | Structured version Visualization version GIF version | ||
| Description: Conditional equality. (Contributed by Jeff Madsen, 2-Sep-2009.) |
| Ref | Expression |
|---|---|
| ifeq1da.1 | ⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| ifeq1da | ⊢ (𝜑 → if(𝜓, 𝐴, 𝐶) = if(𝜓, 𝐵, 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ifeq1da.1 | . . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐵) | |
| 2 | 1 | ifeq1d 4486 | . 2 ⊢ ((𝜑 ∧ 𝜓) → if(𝜓, 𝐴, 𝐶) = if(𝜓, 𝐵, 𝐶)) |
| 3 | iffalse 4475 | . . . 4 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐶) = 𝐶) | |
| 4 | iffalse 4475 | . . . 4 ⊢ (¬ 𝜓 → if(𝜓, 𝐵, 𝐶) = 𝐶) | |
| 5 | 3, 4 | eqtr4d 2774 | . . 3 ⊢ (¬ 𝜓 → if(𝜓, 𝐴, 𝐶) = if(𝜓, 𝐵, 𝐶)) |
| 6 | 5 | adantl 481 | . 2 ⊢ ((𝜑 ∧ ¬ 𝜓) → if(𝜓, 𝐴, 𝐶) = if(𝜓, 𝐵, 𝐶)) |
| 7 | 2, 6 | pm2.61dan 813 | 1 ⊢ (𝜑 → if(𝜓, 𝐴, 𝐶) = if(𝜓, 𝐵, 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ifcif 4466 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-rab 3390 df-v 3431 df-un 3894 df-if 4467 |
| This theorem is referenced by: ifeq12da 4500 cantnflem1d 9609 cantnflem1 9610 dfac12lem1 10066 xrmaxeq 13131 xrmineq 13132 rexmul 13223 max0add 15272 sumeq2ii 15655 fsumser 15692 ramcl 17000 dmdprdsplitlem 20014 coe1pwmul 22244 scmatscmiddistr 22473 mulmarep1gsum1 22538 maducoeval2 22605 madugsum 22608 madurid 22609 ptcld 23578 ibllem 25731 itgvallem3 25753 iblposlem 25759 iblss2 25773 iblmulc2 25798 cnplimc 25854 limcco 25860 dvexp3 25945 dchrinvcl 27216 lgsval2lem 27270 lgsval4lem 27271 lgsneg 27284 lgsmod 27286 lgsdilem2 27296 rpvmasum2 27475 esplyind 33719 mrsubrn 35695 ftc1anclem6 38019 ftc1anclem8 38021 fsuppind 43023 |
| Copyright terms: Public domain | W3C validator |