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 447 | . . 3 |
4 | 1, 3 | exbid 1580 | . 2 |
5 | df-rex 2399 | . 2 | |
6 | df-rex 2399 | . 2 | |
7 | 4, 5, 6 | 3bitr4g 222 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wnf 1421 wex 1453 wcel 1465 wrex 2394 |
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-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-4 1472 ax-ial 1499 |
This theorem depends on definitions: df-bi 116 df-nf 1422 df-rex 2399 |
This theorem is referenced by: rexbidva 2411 rexbid 2413 rexbi 2542 dfiun2g 3815 fun11iun 5356 ismkvnex 6997 mkvprop 7000 |
Copyright terms: Public domain | W3C validator |