| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > necomd | GIF version | ||
| Description: Deduction from commutative law for inequality. (Contributed by NM, 12-Feb-2008.) |
| Ref | Expression |
|---|---|
| necomd.1 | ⊢ (𝜑 → 𝐴 ≠ 𝐵) |
| Ref | Expression |
|---|---|
| necomd | ⊢ (𝜑 → 𝐵 ≠ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | necomd.1 | . 2 ⊢ (𝜑 → 𝐴 ≠ 𝐵) | |
| 2 | necom 2504 | . 2 ⊢ (𝐴 ≠ 𝐵 ↔ 𝐵 ≠ 𝐴) | |
| 3 | 1, 2 | sylib 122 | 1 ⊢ (𝜑 → 𝐵 ≠ 𝐴) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ≠ wne 2420 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-5 1500 ax-gen 1502 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-cleq 2231 df-ne 2421 |
| This theorem is used by: ifnefals 3685 difsnb 3858 0nelop 4388 frecabcl 6670 fidifsnen 7172 tpfidisj 7236 omp1eomlem 7434 difinfsnlem 7439 fodjuomnilemdc 7484 en2eleq 7547 en2other2 7548 netap 7620 2omotaplemap 7623 ltned 8440 lt0ne0 8757 zdceq 9724 zneo 9751 xrlttri3 10209 qdceq 10689 flqltnz 10735 seqf1oglem1 10969 nn0opthd 11174 hashdifpr 11275 hashtpgim 11311 cats1un 11507 sumtp 12197 nninfctlemfo 12833 isprm2lem 12910 oddprm 13058 pcmpt 13142 ennnfonelemex 13354 perfectlem2 16219 lgsneg 16262 lgseisenlem4 16311 lgsquadlem1 16315 lgsquadlem3 16317 lgsquad2 16321 2lgsoddprm 16351 funvtxval0d 16393 umgrvad2edg 16571 1hegrvtxdg1rfi 16670 vdegp1bid 16675 umgr2cwwk2dif 16784 eupth2lem3lem4fi 16833 pw1ndom3lem 17138 pw1ndom3 17139 |
| Copyright terms: Public domain | W3C validator |