Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > 2rexbidva | Unicode version |
Description: Formula-building rule for restricted existential quantifiers (deduction form). (Contributed by NM, 15-Dec-2004.) |
Ref | Expression |
---|---|
2ralbidva.1 |
Ref | Expression |
---|---|
2rexbidva |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2ralbidva.1 | . . . 4 | |
2 | 1 | anassrs 398 | . . 3 |
3 | 2 | rexbidva 2467 | . 2 |
4 | 3 | rexbidva 2467 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 wcel 2141 wrex 2449 |
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 1440 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-4 1503 ax-17 1519 ax-ial 1527 |
This theorem depends on definitions: df-bi 116 df-nf 1454 df-rex 2454 |
This theorem is referenced by: pythagtriplem2 12220 pythagtrip 12237 |
Copyright terms: Public domain | W3C validator |