Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > reubida | Unicode version |
Description: Formula-building rule for restricted existential quantifier (deduction form). (Contributed by Mario Carneiro, 19-Nov-2016.) |
Ref | Expression |
---|---|
reubida.1 | |
reubida.2 |
Ref | Expression |
---|---|
reubida |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | reubida.1 | . . 3 | |
2 | reubida.2 | . . . 4 | |
3 | 2 | pm5.32da 447 | . . 3 |
4 | 1, 3 | eubid 2006 | . 2 |
5 | df-reu 2423 | . 2 | |
6 | df-reu 2423 | . 2 | |
7 | 4, 5, 6 | 3bitr4g 222 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wnf 1436 wcel 1480 weu 1999 wreu 2418 |
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 1423 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-4 1487 ax-17 1506 ax-ial 1514 |
This theorem depends on definitions: df-bi 116 df-nf 1437 df-eu 2002 df-reu 2423 |
This theorem is referenced by: reubidva 2613 |
Copyright terms: Public domain | W3C validator |