| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ifnefals | GIF version | ||
| Description: Deduce falsehood from a conditional operator value. (Contributed by Thierry Arnoux, 20-Feb-2025.) |
| Ref | Expression |
|---|---|
| ifnefals | ⊢ ((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) → ¬ 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | iftrue 3626 | . . 3 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
| 2 | 1 | adantl 277 | . 2 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → if(𝜑, 𝐴, 𝐵) = 𝐴) |
| 3 | simplr 529 | . . . 4 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
| 4 | simpll 527 | . . . . 5 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → 𝐴 ≠ 𝐵) | |
| 5 | 4 | necomd 2498 | . . . 4 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → 𝐵 ≠ 𝐴) |
| 6 | 3, 5 | eqnetrd 2436 | . . 3 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → if(𝜑, 𝐴, 𝐵) ≠ 𝐴) |
| 7 | 6 | neneqd 2433 | . 2 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → ¬ if(𝜑, 𝐴, 𝐵) = 𝐴) |
| 8 | 2, 7 | pm2.65da 667 | 1 ⊢ ((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) → ¬ 𝜑) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1398 ≠ wne 2412 ifcif 3619 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-11 1555 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2214 |
| This theorem depends on definitions: df-bi 117 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-ne 2413 df-if 3620 |
| This theorem is referenced by: ifnebibdc 3667 |
| Copyright terms: Public domain | W3C validator |