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 rule). (Contributed by NM, 21-Feb-2004.) |
Ref | Expression |
---|---|
oprabbidv.1 |
Ref | Expression |
---|---|
oprabbidv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1461 | . 2 | |
2 | nfv 1461 | . 2 | |
3 | nfv 1461 | . 2 | |
4 | oprabbidv.1 | . 2 | |
5 | 1, 2, 3, 4 | oprabbid 5578 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 103 wceq 1284 coprab 5533 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-11 1437 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-oprab 5536 |
This theorem is referenced by: oprabbii 5580 mpt2eq123dva 5586 mpt2eq3dva 5589 resoprab2 5618 erovlem 6221 |
Copyright terms: Public domain | W3C validator |