Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > opabbidv | Unicode version |
Description: Equivalent wff's yield equal ordered-pair class abstractions (deduction form). (Contributed by NM, 15-May-1995.) |
Ref | Expression |
---|---|
opabbidv.1 |
Ref | Expression |
---|---|
opabbidv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1508 | . 2 | |
2 | nfv 1508 | . 2 | |
3 | opabbidv.1 | . 2 | |
4 | 1, 2, 3 | opabbid 3988 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 104 wceq 1331 copab 3983 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-11 1484 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-opab 3985 |
This theorem is referenced by: opabbii 3990 csbopabg 4001 xpeq1 4548 xpeq2 4549 opabbi2dv 4683 csbcnvg 4718 resopab2 4861 mptcnv 4936 cores 5037 xpcom 5080 dffn5im 5460 f1oiso2 5721 f1ocnvd 5965 ofreq 5978 f1od2 6125 shftfvalg 10583 shftfval 10586 2shfti 10596 lmfval 12350 |
Copyright terms: Public domain | W3C validator |