| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Elimination of double substitution. |
| Ref | Expression |
|---|---|
| sbel2x |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbelx 1344 |
. . . . 5
| |
| 2 | 1 | anbi2i 480 |
. . . 4
|
| 3 | 2 | exbii 1051 |
. . 3
|
| 4 | sbelx 1344 |
. . 3
| |
| 5 | exdistr 1309 |
. . 3
| |
| 6 | 3, 4, 5 | 3bitr4 183 |
. 2
|
| 7 | anass 439 |
. . 3
| |
| 8 | 7 | 2exbii 1052 |
. 2
|
| 9 | 6, 8 | bitr4 176 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: opabid 2810 |
| 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 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 981 df-sb 1172 |