| 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 1551 |
. 2
| |
| 2 | nfv 1551 |
. 2
| |
| 3 | nfv 1551 |
. 2
| |
| 4 | oprabbidv.1 |
. 2
| |
| 5 | 1, 2, 3, 4 | oprabbid 5998 |
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 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-11 1529 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-ext 2187 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1484 df-sb 1786 df-clab 2192 df-cleq 2198 df-oprab 5948 |
| This theorem is referenced by: oprabbii 6000 mpoeq123dva 6006 mpoeq3dva 6009 resoprab2 6042 erovlem 6714 |
| Copyright terms: Public domain | W3C validator |