| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Define the proper substitution of a class for a set into another class. The underlined brackets distinguish it from the substitution into a wff, wsbc 1166, to prevent ambiguity. Theorem sbcel1g 2003 shows an example of how ambiguity could arise if we didn't use distinguished brackets. Theorem sbccsbg 2012 recreates substitution into a wff from this definition. |
| Ref | Expression |
|---|---|
| df-csb |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vx |
. . 3
| |
| 2 | cA |
. . 3
| |
| 3 | cB |
. . 3
| |
| 4 | 1, 2, 3 | csb 1991 |
. 2
|
| 5 | vy |
. . . . . 6
| |
| 6 | 5 | cv 952 |
. . . . 5
|
| 7 | 6, 3 | wcel 955 |
. . . 4
|
| 8 | 7, 1, 2 | wsbc 1166 |
. . 3
|
| 9 | 8, 5 | cab 1456 |
. 2
|
| 10 | 4, 9 | wceq 953 |
1
|
| Colors of variables: wff set class |
| This definition is referenced by: csbeq1 1993 csbid 1995 csbcog 1997 csbexg 1998 csbconstgf 2000 sbcel12g 2001 sbceqdig 2002 csbvarg 2011 hbcsb1g 2014 hbcsbg 2016 csbiegft 2019 csbabg 2033 fsump1f 6949 |