| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ifeq2da | Structured version Visualization version GIF version | ||
| Description: Conditional equality. (Contributed by Jeff Madsen, 2-Sep-2009.) |
| Ref | Expression |
|---|---|
| ifeq2da.1 | ⊢ ((𝜑 ∧ ¬ 𝜓) → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| ifeq2da | ⊢ (𝜑 → if(𝜓, 𝐶, 𝐴) = if(𝜓, 𝐶, 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iftrue 4473 | . . . 4 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐴) = 𝐶) | |
| 2 | iftrue 4473 | . . . 4 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐵) = 𝐶) | |
| 3 | 1, 2 | eqtr4d 2775 | . . 3 ⊢ (𝜓 → if(𝜓, 𝐶, 𝐴) = if(𝜓, 𝐶, 𝐵)) |
| 4 | 3 | adantl 481 | . 2 ⊢ ((𝜑 ∧ 𝜓) → if(𝜓, 𝐶, 𝐴) = if(𝜓, 𝐶, 𝐵)) |
| 5 | ifeq2da.1 | . . 3 ⊢ ((𝜑 ∧ ¬ 𝜓) → 𝐴 = 𝐵) | |
| 6 | 5 | ifeq2d 4488 | . 2 ⊢ ((𝜑 ∧ ¬ 𝜓) → if(𝜓, 𝐶, 𝐴) = if(𝜓, 𝐶, 𝐵)) |
| 7 | 4, 6 | pm2.61dan 813 | 1 ⊢ (𝜑 → if(𝜓, 𝐶, 𝐴) = if(𝜓, 𝐶, 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1542 ifcif 4467 |
| 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 2709 |
| 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 2716 df-cleq 2729 df-clel 2812 df-rab 3391 df-v 3432 df-un 3895 df-if 4468 |
| This theorem is referenced by: ifeq12da 4501 dfac12lem1 10057 ttukeylem3 10424 xmulcom 13209 xmulneg1 13212 subgmulg 19107 1marepvmarrepid 22550 pcopt2 25000 limcdif 25853 limcmpt 25860 limcres 25863 limccnp 25868 radcnv0 26394 leibpi 26919 efrlim 26946 efrlimOLD 26947 dchrvmasumiflem2 27479 padicabvf 27608 padicabvcxp 27609 itg2addnclem 38006 fourierdlem73 46625 fourierdlem76 46628 fourierdlem89 46641 fourierdlem91 46643 |
| Copyright terms: Public domain | W3C validator |