![]() |
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 3562 | . . 3 ⊢ (𝜑 → if(𝜑, 𝐴, 𝐵) = 𝐴) | |
2 | 1 | adantl 277 | . 2 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → if(𝜑, 𝐴, 𝐵) = 𝐴) |
3 | simplr 528 | . . . 4 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → if(𝜑, 𝐴, 𝐵) = 𝐵) | |
4 | simpll 527 | . . . . 5 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → 𝐴 ≠ 𝐵) | |
5 | 4 | necomd 2450 | . . . 4 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → 𝐵 ≠ 𝐴) |
6 | 3, 5 | eqnetrd 2388 | . . 3 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → if(𝜑, 𝐴, 𝐵) ≠ 𝐴) |
7 | 6 | neneqd 2385 | . 2 ⊢ (((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) ∧ 𝜑) → ¬ if(𝜑, 𝐴, 𝐵) = 𝐴) |
8 | 2, 7 | pm2.65da 662 | 1 ⊢ ((𝐴 ≠ 𝐵 ∧ if(𝜑, 𝐴, 𝐵) = 𝐵) → ¬ 𝜑) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 = wceq 1364 ≠ wne 2364 ifcif 3557 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-11 1517 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2175 |
This theorem depends on definitions: df-bi 117 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-ne 2365 df-if 3558 |
This theorem is referenced by: ifnebibdc 3600 |
Copyright terms: Public domain | W3C validator |