Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sbco2 | Structured version Visualization version Unicode version |
Description: A composition law for substitution. (Contributed by NM, 30-Jun-1994.) (Revised by Mario Carneiro, 6-Oct-2016.) (Proof shortened by Wolf Lammen, 17-Sep-2018.) |
Ref | Expression |
---|---|
sbco2.1 |
Ref | Expression |
---|---|
sbco2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbequ12 2111 | . . . 4 | |
2 | sbequ 2376 | . . . 4 | |
3 | 1, 2 | bitr3d 270 | . . 3 |
4 | 3 | sps 2055 | . 2 |
5 | nfnae 2318 | . . 3 | |
6 | sbco2.1 | . . . 4 | |
7 | 6 | nfsb4 2390 | . . 3 |
8 | 2 | a1i 11 | . . 3 |
9 | 5, 7, 8 | sbied 2409 | . 2 |
10 | 4, 9 | pm2.61i 176 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wn 3 wi 4 wb 196 wal 1481 wnf 1708 wsb 1880 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 |
This theorem is referenced by: sbco2d 2416 equsb3ALT 2433 elsb3 2434 elsb4 2435 sb7f 2453 sbco4lem 2465 sbco4 2466 eqsb3 2728 clelsb3 2729 cbvab 2746 clelsb3f 2768 sbralie 3184 sbcco 3458 bj-clelsb3 32848 |
Copyright terms: Public domain | W3C validator |