New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > sbcrext | Unicode version |
Description: Interchange class substitution and restricted existential quantifier. (Contributed by NM, 1-Mar-2008.) (Proof shortened by Mario Carneiro, 13-Oct-2016.) |
Ref | Expression |
---|---|
sbcrext |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 2868 | . 2 | |
2 | sbcng 3087 | . . . . 5 | |
3 | 2 | adantr 451 | . . . 4 |
4 | sbcralt 3119 | . . . . . 6 | |
5 | nfnfc1 2493 | . . . . . . . . 9 | |
6 | id 19 | . . . . . . . . . 10 | |
7 | nfcvd 2491 | . . . . . . . . . 10 | |
8 | 6, 7 | nfeld 2505 | . . . . . . . . 9 |
9 | 5, 8 | nfan1 1881 | . . . . . . . 8 |
10 | sbcng 3087 | . . . . . . . . 9 | |
11 | 10 | adantl 452 | . . . . . . . 8 |
12 | 9, 11 | ralbid 2633 | . . . . . . 7 |
13 | 12 | ancoms 439 | . . . . . 6 |
14 | 4, 13 | bitrd 244 | . . . . 5 |
15 | 14 | notbid 285 | . . . 4 |
16 | 3, 15 | bitrd 244 | . . 3 |
17 | dfrex2 2628 | . . . 4 | |
18 | 17 | sbcbii 3102 | . . 3 |
19 | dfrex2 2628 | . . 3 | |
20 | 16, 18, 19 | 3bitr4g 279 | . 2 |
21 | 1, 20 | sylan 457 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wb 176 wa 358 wcel 1710 wnfc 2477 wral 2615 wrex 2616 cvv 2860 wsbc 3047 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-6 1729 ax-7 1734 ax-11 1746 ax-12 1925 ax-ext 2334 |
This theorem depends on definitions: df-bi 177 df-or 359 df-an 360 df-3an 936 df-tru 1319 df-ex 1542 df-nf 1545 df-sb 1649 df-clab 2340 df-cleq 2346 df-clel 2349 df-nfc 2479 df-ral 2620 df-rex 2621 df-v 2862 df-sbc 3048 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |