| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). |
| Ref | Expression |
|---|---|
| drsb1 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equequ1 1171 |
. . . . 5
| |
| 2 | 1 | a4s 1020 |
. . . 4
|
| 3 | 2 | imbi1d 616 |
. . 3
|
| 4 | 2 | anbi1d 620 |
. . . 4
|
| 5 | 4 | drex1 1193 |
. . 3
|
| 6 | 3, 5 | anbi12d 631 |
. 2
|
| 7 | df-sb 1209 |
. 2
| |
| 8 | df-sb 1209 |
. 2
| |
| 9 | 6, 7, 8 | 3bitr4g 558 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: sbequi 1265 sbco3 1295 sbcom 1296 sb9i 1301 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 998 ax-gen 999 ax-8 1000 ax-10 1002 ax-12 1004 ax-4 1009 ax-5o 1011 ax-6o 1014 ax-9o 1159 ax-10o 1177 |
| This theorem depends on definitions: df-bi 145 df-an 223 df-ex 1017 df-sb 1209 |