| 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 2413 | . 2 ⊢ (𝐴 = 𝐵 → (𝐴 ≠ 𝐶 ↔ 𝐵 ≠ 𝐶)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → (𝐴 ≠ 𝐶 ↔ 𝐵 ≠ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1395 ≠ wne 2400 |
| 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 617 ax-in2 618 ax-5 1493 ax-gen 1495 ax-4 1556 ax-17 1572 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-cleq 2222 df-ne 2401 |
| This theorem is referenced by: neeq12d 2420 eqnetrd 2424 prnzg 3795 pw2f1odclem 7015 hashprg 11065 algcvg 12613 algcvga 12616 eucalgcvga 12623 rpdvds 12664 phibndlem 12781 dfphi2 12785 pcaddlem 12905 ennnfoneleminc 13025 ennnfonelemex 13028 ennnfonelemhom 13029 ennnfonelemnn0 13036 ennnfonelemr 13037 ennnfonelemim 13038 ctinfomlemom 13041 setscomd 13116 lgsne0 15760 umgr2cwwkdifex 16234 dceqnconst 16614 dcapnconst 16615 nconstwlpolem 16619 |
| Copyright terms: Public domain | W3C validator |