| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Interchange class substitution and restricted existential quantifier. |
| Ref | Expression |
|---|---|
| sbcralgf.1 |
|
| Ref | Expression |
|---|---|
| sbcrexgf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfrex2 1653 |
. . . . . 6
| |
| 2 | 1 | sbcbii 1974 |
. . . . 5
|
| 3 | sbcng 1965 |
. . . . 5
| |
| 4 | 2, 3 | bitrd 527 |
. . . 4
|
| 5 | 4 | a4s 982 |
. . 3
|
| 6 | sbcralgf.1 |
. . . . . 6
| |
| 7 | 6 | sbcralgf 1988 |
. . . . 5
|
| 8 | hba1 1001 |
. . . . . 6
| |
| 9 | sbcng 1965 |
. . . . . . 7
| |
| 10 | 9 | a4s 982 |
. . . . . 6
|
| 11 | 8, 10 | ralbid 1658 |
. . . . 5
|
| 12 | 7, 11 | bitrd 527 |
. . . 4
|
| 13 | 12 | negbid 610 |
. . 3
|
| 14 | 5, 13 | bitrd 527 |
. 2
|
| 15 | dfrex2 1653 |
. 2
| |
| 16 | 14, 15 | syl6bbr 537 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 960 ax-gen 961 ax-8 962 ax-9 963 ax-10 964 ax-11 965 ax-12 966 ax-17 969 ax-4 971 ax-5o 973 ax-6o 976 ax-9o 1121 ax-10o 1138 ax-16 1208 ax-11o 1216 ax-ext 1457 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 979 df-sb 1170 df-clab 1462 df-cleq 1467 df-clel 1470 df-ral 1646 df-rex 1647 df-v 1808 df-sbc 1938 |