Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > sbcralt | Unicode version |
Description: Interchange class substitution and restricted quantifier. (Contributed by NM, 1-Mar-2008.) (Revised by David Abernethy, 22-Feb-2010.) |
Ref | Expression |
---|---|
sbcralt |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbcco 2785 | . 2 | |
2 | simpl 102 | . . 3 | |
3 | sbsbc 2768 | . . . . 5 | |
4 | nfcv 2178 | . . . . . . 7 | |
5 | nfs1v 1815 | . . . . . . 7 | |
6 | 4, 5 | nfralxy 2360 | . . . . . 6 |
7 | sbequ12 1654 | . . . . . . 7 | |
8 | 7 | ralbidv 2326 | . . . . . 6 |
9 | 6, 8 | sbie 1674 | . . . . 5 |
10 | 3, 9 | bitr3i 175 | . . . 4 |
11 | nfnfc1 2181 | . . . . . . 7 | |
12 | nfcvd 2179 | . . . . . . . 8 | |
13 | id 19 | . . . . . . . 8 | |
14 | 12, 13 | nfeqd 2192 | . . . . . . 7 |
15 | 11, 14 | nfan1 1456 | . . . . . 6 |
16 | dfsbcq2 2767 | . . . . . . 7 | |
17 | 16 | adantl 262 | . . . . . 6 |
18 | 15, 17 | ralbid 2324 | . . . . 5 |
19 | 18 | adantll 445 | . . . 4 |
20 | 10, 19 | syl5bb 181 | . . 3 |
21 | 2, 20 | sbcied 2799 | . 2 |
22 | 1, 21 | syl5bbr 183 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wb 98 wceq 1243 wcel 1393 wsb 1645 wnfc 2165 wral 2306 wsbc 2764 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-v 2559 df-sbc 2765 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |