Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > neeq1d | GIF version |
Description: Deduction for inequality. (Contributed by NM, 25-Oct-1999.) |
Ref | Expression |
---|---|
neeq1d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
Ref | Expression |
---|---|
neeq1d | ⊢ (𝜑 → (𝐴 ≠ 𝐶 ↔ 𝐵 ≠ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | neeq1d.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
2 | neeq1 2258 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ≠ 𝐶 ↔ 𝐵 ≠ 𝐶)) | |
3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → (𝐴 ≠ 𝐶 ↔ 𝐵 ≠ 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 103 = wceq 1284 ≠ wne 2245 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 576 ax-in2 577 ax-5 1376 ax-gen 1378 ax-4 1440 ax-17 1459 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-cleq 2074 df-ne 2246 |
This theorem is referenced by: neeq12d 2265 eqnetrd 2269 prnzg 3514 ialgcvg 10430 ialgcvga 10433 eucialgcvga 10440 rpdvds 10481 |
Copyright terms: Public domain | W3C validator |