Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rexbida | Unicode version |
Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by NM, 6-Oct-2003.) |
Ref | Expression |
---|---|
ralbida.1 | |
ralbida.2 |
Ref | Expression |
---|---|
rexbida |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ralbida.1 | . . 3 | |
2 | ralbida.2 | . . . 4 | |
3 | 2 | pm5.32da 448 | . . 3 |
4 | 1, 3 | exbid 1603 | . 2 |
5 | df-rex 2448 | . 2 | |
6 | df-rex 2448 | . 2 | |
7 | 4, 5, 6 | 3bitr4g 222 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wnf 1447 wex 1479 wcel 2135 wrex 2443 |
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 1434 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-4 1497 ax-ial 1521 |
This theorem depends on definitions: df-bi 116 df-nf 1448 df-rex 2448 |
This theorem is referenced by: rexbidva 2461 rexbid 2463 rexbi 2597 dfiun2g 3892 fun11iun 5447 ismkvnex 7110 mkvprop 7113 |
Copyright terms: Public domain | W3C validator |