| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hadifpOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of hadifp 1637 as of 10-Aug-2026. (Contributed by BJ, 11-Aug-2020.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| hadifpOLD | ⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ if-(𝜑, (𝜓 ↔ 𝜒), (𝜓 ⊻ 𝜒))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | had1OLD 1635 | . 2 ⊢ (𝜑 → (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜓 ↔ 𝜒))) | |
| 2 | had0OLD 1636 | . 2 ⊢ (¬ 𝜑 → (hadd(𝜑, 𝜓, 𝜒) ↔ (𝜓 ⊻ 𝜒))) | |
| 3 | 1, 2 | casesifp 1094 | 1 ⊢ (hadd(𝜑, 𝜓, 𝜒) ↔ if-(𝜑, (𝜓 ↔ 𝜒), (𝜓 ⊻ 𝜒))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 if-wif 1078 ⊻ wxo 1541 haddwhad 1623 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-ifp 1079 df-xor 1542 df-had 1624 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |