| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nfne | Structured version Visualization version GIF version | ||
| Description: Bound-variable hypothesis builder for inequality. (Contributed by NM, 10-Nov-2007.) (Revised by Mario Carneiro, 7-Oct-2016.) |
| Ref | Expression |
|---|---|
| nfne.1 | ⊢ Ⅎ𝑥𝐴 |
| nfne.2 | ⊢ Ⅎ𝑥𝐵 |
| Ref | Expression |
|---|---|
| nfne | ⊢ Ⅎ𝑥 𝐴 ≠ 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ne 2960 | . 2 ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵) | |
| 2 | nfne.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
| 3 | nfne.2 | . . . 4 ⊢ Ⅎ𝑥𝐵 | |
| 4 | 2, 3 | nfeq 2939 | . . 3 ⊢ Ⅎ𝑥 𝐴 = 𝐵 |
| 5 | 4 | nfn 1890 | . 2 ⊢ Ⅎ𝑥 ¬ 𝐴 = 𝐵 |
| 6 | 1, 5 | nfxfr 1886 | 1 ⊢ Ⅎ𝑥 𝐴 ≠ 𝐵 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 Ⅎwnf 1816 Ⅎwnfc 2911 ≠ wne 2959 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-nf 1817 df-cleq 2755 df-nfc 2913 df-ne 2960 |
| This theorem is used by: cantnflem1 9727 ac6c4 10598 fproddiv 16172 fprodn0 16190 fproddivf 16198 mreiincl 17816 lss1d 21289 iunconn 23801 restmetu 24944 coeeq2 26616 ltsval2 28070 fedgmullem2 34373 bnj1534 35594 bnj1542 35598 bnj1398 35775 bnj1445 35785 bnj1449 35789 bnj1312 35799 bnj1525 35810 cvmcov 36236 nfwlim 36799 finminlem 37321 finxpreclem2 38581 poimirlem25 38831 poimirlem26 38832 poimirlem28 38834 cdleme40m 41790 cdleme40n 41791 dihglblem5 42621 iunconnlem2 46238 eliuniin2 46469 disjf1 46532 disjrnmpt2 46537 disjinfi 46541 allbutfiinf 46764 fsumiunss 46921 idlimc 46972 0ellimcdiv 46993 stoweidlem31 47375 stoweidlem58 47402 fourierdlem31 47482 sge0iunmpt 47762 |
| Copyright terms: Public domain | W3C validator |