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 rule). (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 425 | . . 3 |
4 | 1, 3 | eubid 1907 | . 2 |
5 | df-reu 2313 | . 2 | |
6 | df-reu 2313 | . 2 | |
7 | 4, 5, 6 | 3bitr4g 212 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wb 98 wnf 1349 wcel 1393 weu 1900 wreu 2308 |
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-17 1419 ax-ial 1427 |
This theorem depends on definitions: df-bi 110 df-nf 1350 df-eu 1903 df-reu 2313 |
This theorem is referenced by: reubidva 2492 |
Copyright terms: Public domain | W3C validator |