Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > sbco4 | Structured version Visualization version Unicode version |
Description: Two ways of exchanging two variables. Both sides of the biconditional exchange and , either via two temporary variables and , or a single temporary . (Contributed by Jim Kingdon, 25-Sep-2018.) |
Ref | Expression |
---|---|
sbco4 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sbcom2 2445 | . . 3 | |
2 | nfv 1843 | . . . . 5 | |
3 | 2 | sbco2 2415 | . . . 4 |
4 | 3 | sbbii 1887 | . . 3 |
5 | 1, 4 | bitr3i 266 | . 2 |
6 | sbco4lem 2465 | . 2 | |
7 | sbco4lem 2465 | . 2 | |
8 | 5, 6, 7 | 3bitri 286 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wb 196 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: (None) |
Copyright terms: Public domain | W3C validator |