| 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 3053 |
. 2
| |
| 2 | simpl 109 |
. . 3
| |
| 3 | sbsbc 3035 |
. . . . 5
| |
| 4 | nfcv 2374 |
. . . . . . 7
| |
| 5 | nfs1v 1992 |
. . . . . . 7
| |
| 6 | 4, 5 | nfralxy 2570 |
. . . . . 6
|
| 7 | sbequ12 1819 |
. . . . . . 7
| |
| 8 | 7 | ralbidv 2532 |
. . . . . 6
|
| 9 | 6, 8 | sbie 1839 |
. . . . 5
|
| 10 | 3, 9 | bitr3i 186 |
. . . 4
|
| 11 | nfnfc1 2377 |
. . . . . . 7
| |
| 12 | nfcvd 2375 |
. . . . . . . 8
| |
| 13 | id 19 |
. . . . . . . 8
| |
| 14 | 12, 13 | nfeqd 2389 |
. . . . . . 7
|
| 15 | 11, 14 | nfan1 1612 |
. . . . . 6
|
| 16 | dfsbcq2 3034 |
. . . . . . 7
| |
| 17 | 16 | adantl 277 |
. . . . . 6
|
| 18 | 15, 17 | ralbid 2530 |
. . . . 5
|
| 19 | 18 | adantll 476 |
. . . 4
|
| 20 | 10, 19 | bitrid 192 |
. . 3
|
| 21 | 2, 20 | sbcied 3068 |
. 2
|
| 22 | 1, 21 | bitr3id 194 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-v 2804 df-sbc 3032 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |