Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nfsbcd | Structured version Visualization version Unicode version |
Description: Deduction version of nfsbc 3457. (Contributed by NM, 23-Nov-2005.) (Revised by Mario Carneiro, 12-Oct-2016.) |
Ref | Expression |
---|---|
nfsbcd.1 | |
nfsbcd.2 | |
nfsbcd.3 |
Ref | Expression |
---|---|
nfsbcd |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-sbc 3436 | . 2 | |
2 | nfsbcd.2 | . . 3 | |
3 | nfsbcd.1 | . . . 4 | |
4 | nfsbcd.3 | . . . 4 | |
5 | 3, 4 | nfabd 2785 | . . 3 |
6 | 2, 5 | nfeld 2773 | . 2 |
7 | 1, 6 | nfxfrd 1780 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wnf 1708 wcel 1990 cab 2608 wnfc 2751 wsbc 3435 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-sbc 3436 |
This theorem is referenced by: nfsbc 3457 nfcsbd 3550 sbcnestgf 3995 |
Copyright terms: Public domain | W3C validator |