Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rabbidva | Unicode version |
Description: Equivalent wff's yield equal restricted class abstractions (deduction rule). (Contributed by NM, 28-Nov-2003.) |
Ref | Expression |
---|---|
rabbidva.1 |
Ref | Expression |
---|---|
rabbidva |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rabbidva.1 | . . 3 | |
2 | 1 | ralrimiva 2434 | . 2 |
3 | rabbi 2531 | . 2 | |
4 | 2, 3 | sylib 120 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 102 wb 103 wceq 1284 wcel 1433 wral 2348 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: rabbidv 2593 rabeqbidva 2597 rabbi2dva 3174 rabxfrd 4219 onsucmin 4251 seinxp 4429 fniniseg2 5310 fnniniseg2 5311 f1oresrab 5350 dfinfre 8034 minmax 10112 gcdass 10404 lcmass 10467 |
Copyright terms: Public domain | W3C validator |