| 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 452 | 
. . 3
 | 
| 4 | 1, 3 | exbid 1630 | 
. 2
 | 
| 5 | df-rex 2481 | 
. 2
 | |
| 6 | df-rex 2481 | 
. 2
 | |
| 7 | 4, 5, 6 | 3bitr4g 223 | 
1
 | 
| Colors of variables: wff set class | 
| Syntax hints:     | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1461 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-4 1524 ax-ial 1548 | 
| This theorem depends on definitions: df-bi 117 df-nf 1475 df-rex 2481 | 
| This theorem is referenced by: rexbidva 2494 rexbid 2496 rexbi 2630 dfiun2g 3948 fun11iun 5525 ismkvnex 7221 mkvprop 7224 | 
| Copyright terms: Public domain | W3C validator |