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 form). (Contributed by NM, 28-Nov-2003.) |
Ref | Expression |
---|---|
rabbidva.1 |
Ref | Expression |
---|---|
rabbidva |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rabbidva.1 | . . 3 | |
2 | 1 | ralrimiva 2482 | . 2 |
3 | rabbi 2585 | . 2 | |
4 | 2, 3 | sylib 121 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wceq 1316 wcel 1465 wral 2393 crab 2397 |
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 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-11 1469 ax-4 1472 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 |
This theorem depends on definitions: df-bi 116 df-tru 1319 df-nf 1422 df-sb 1721 df-clab 2104 df-cleq 2110 df-ral 2398 df-rab 2402 |
This theorem is referenced by: rabbidv 2649 rabeqbidva 2656 rabbi2dva 3254 rabxfrd 4360 onsucmin 4393 seinxp 4580 fniniseg2 5510 fnniniseg2 5511 f1oresrab 5553 dfinfre 8682 minmax 10969 xrminmax 11002 iooinsup 11014 gcdass 11630 lcmass 11693 bdbl 12599 xmetxpbl 12604 |
Copyright terms: Public domain | W3C validator |