Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rabbidv | Unicode version |
Description: Equivalent wff's yield equal restricted class abstractions (deduction rule). (Contributed by NM, 10-Feb-1995.) |
Ref | Expression |
---|---|
rabbidv.1 |
Ref | Expression |
---|---|
rabbidv |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rabbidv.1 | . . 3 | |
2 | 1 | adantr 270 | . 2 |
3 | 2 | rabbidva 2592 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 103 wceq 1284 wcel 1433 crab 2352 |
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-ral 2353 df-rab 2357 |
This theorem is referenced by: rabeqbidv 2596 difeq2 3084 seex 4090 mptiniseg 4835 supeq1 6399 supeq2 6402 supeq3 6403 cardcl 6450 isnumi 6451 cardval3ex 6454 carden2bex 6458 genpdflem 6697 genipv 6699 genpelxp 6701 addcomprg 6768 mulcomprg 6770 uzval 8621 ixxval 8919 fzval 9031 shftfn 9712 gcdval 10351 lcmval 10445 isprm 10491 |
Copyright terms: Public domain | W3C validator |