| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > oprabbidv | Unicode version | ||
| Description: Equivalent wff's yield equal operation class abstractions (deduction form). (Contributed by NM, 21-Feb-2004.) |
| Ref | Expression |
|---|---|
| oprabbidv.1 |
|
| Ref | Expression |
|---|---|
| oprabbidv |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1581 |
. 2
| |
| 2 | nfv 1581 |
. 2
| |
| 3 | nfv 1581 |
. 2
| |
| 4 | oprabbidv.1 |
. 2
| |
| 5 | 1, 2, 3, 4 | oprabbid 6131 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-11 1559 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-oprab 6079 |
| This theorem is referenced by: oprabbii 6133 mpoeq123dva 6139 mpoeq3dva 6142 resoprab2 6175 erovlem 6891 |
| Copyright terms: Public domain | W3C validator |