Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfnfc2 | Structured version Visualization version Unicode version |
Description: An alternative statement of the effective freeness of a class , when it is a set. (Contributed by Mario Carneiro, 14-Oct-2016.) (Proof shortened by JJ, 26-Jul-2021.) |
Ref | Expression |
---|---|
dfnfc2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfcvd 2765 | . . . 4 | |
2 | id 22 | . . . 4 | |
3 | 1, 2 | nfeqd 2772 | . . 3 |
4 | 3 | alrimiv 1855 | . 2 |
5 | df-nfc 2753 | . . . . 5 | |
6 | velsn 4193 | . . . . . . 7 | |
7 | 6 | nfbii 1778 | . . . . . 6 |
8 | 7 | albii 1747 | . . . . 5 |
9 | 5, 8 | sylbbr 226 | . . . 4 |
10 | 9 | nfunid 4443 | . . 3 |
11 | nfa1 2028 | . . . 4 | |
12 | unisng 4452 | . . . . 5 | |
13 | 12 | sps 2055 | . . . 4 |
14 | 11, 13 | nfceqdf 2760 | . . 3 |
15 | 10, 14 | syl5ib 234 | . 2 |
16 | 4, 15 | impbid2 216 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 wal 1481 wceq 1483 wnf 1708 wcel 1990 wnfc 2751 csn 4177 cuni 4436 |
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-ral 2917 df-rex 2918 df-v 3202 df-un 3579 df-sn 4178 df-pr 4180 df-uni 4437 |
This theorem is referenced by: eusv2nf 4864 |
Copyright terms: Public domain | W3C validator |