| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Equivalent wff's yield equal restricted class abstractions (inference rule). |
| Ref | Expression |
|---|---|
| birabi.1 |
|
| Ref | Expression |
|---|---|
| birabi |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | birabi.1 |
. . . 4
| |
| 2 | 1 | pm5.32i 489 |
. . 3
|
| 3 | 2 | biabi 1181 |
. 2
|
| 4 | df-rab 1208 |
. 2
| |
| 5 | df-rab 1208 |
. 2
| |
| 6 | 3, 4, 5 | 3eqtr4 1126 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: bm2.5ii 2274 nlimon 2369 rankval2 3514 ranksn 3532 kmlem3 3582 hta 3619 alephsuc3 4955 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-16 922 ax-17 925 ax-ext 1074 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-rab 1208 |