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 rule). (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 439 | . . 3 |
4 | 1, 3 | exbid 1547 | . 2 |
5 | df-rex 2354 | . 2 | |
6 | df-rex 2354 | . 2 | |
7 | 4, 5, 6 | 3bitr4g 221 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 102 wb 103 wnf 1389 wex 1421 wcel 1433 wrex 2349 |
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-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-4 1440 ax-ial 1467 |
This theorem depends on definitions: df-bi 115 df-nf 1390 df-rex 2354 |
This theorem is referenced by: rexbidva 2365 rexbid 2367 rexbi 2490 dfiun2g 3710 fun11iun 5167 |
Copyright terms: Public domain | W3C validator |