| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Conversion of implicit substitution to explicit substitution into a class. |
| Ref | Expression |
|---|---|
| csbief.1 |
|
| csbief.2 |
|
| csbief.3 |
|
| Ref | Expression |
|---|---|
| csbief |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | csbief.3 |
. . 3
| |
| 2 | 1 | ax-gen 963 |
. 2
|
| 3 | csbief.1 |
. . 3
| |
| 4 | csbief.2 |
. . 3
| |
| 5 | 3, 4 | csbieb 2030 |
. 2
|
| 6 | 2, 5 | mpbi 189 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: eqerlem 4270 binomlem1 7066 binomlem2 7067 binomlem4 7069 iserzshft2 7107 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 962 ax-gen 963 ax-8 964 ax-10 966 ax-12 968 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-10o 1140 ax-16 1210 ax-11o 1218 ax-ext 1459 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 981 df-sb 1172 df-clab 1464 df-cleq 1469 df-clel 1472 df-v 1812 df-sbc 1942 df-csb 2002 |