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 425 | . . 3 |
4 | 1, 3 | exbid 1507 | . 2 |
5 | df-rex 2312 | . 2 | |
6 | df-rex 2312 | . 2 | |
7 | 4, 5, 6 | 3bitr4g 212 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wb 98 wnf 1349 wex 1381 wcel 1393 wrex 2307 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-5 1336 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-4 1400 ax-ial 1427 |
This theorem depends on definitions: df-bi 110 df-nf 1350 df-rex 2312 |
This theorem is referenced by: rexbidva 2323 rexbid 2325 rexbi 2446 dfiun2g 3689 fun11iun 5147 |
Copyright terms: Public domain | W3C validator |