Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > sbco3 | Unicode version |
Description: A composition law for substitution. (Contributed by NM, 5-Aug-1993.) (Proof rewritten by Jim Kingdon, 22-Mar-2018.) |
Ref | Expression |
---|---|
sbco3 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbco3xzyz 1847 | . . 3 | |
2 | 1 | sbbii 1648 | . 2 |
3 | ax-17 1419 | . . 3 | |
4 | 3 | sbco2h 1838 | . 2 |
5 | ax-17 1419 | . . 3 | |
6 | 5 | sbco2h 1838 | . 2 |
7 | 2, 4, 6 | 3bitr3i 199 | 1 |
Colors of variables: wff set class |
Syntax hints: wb 98 wsb 1645 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 |
This theorem depends on definitions: df-bi 110 df-nf 1350 df-sb 1646 |
This theorem is referenced by: sbcom 1849 |
Copyright terms: Public domain | W3C validator |