Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ra5 | Unicode version |
Description: Restricted quantifier version of Axiom 5 of [Mendelson] p. 69. This is an axiom of a predicate calculus for a restricted domain. Compare the unrestricted stdpc5 1564. (Contributed by NM, 16-Jan-2004.) |
Ref | Expression |
---|---|
ra5.1 |
Ref | Expression |
---|---|
ra5 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ral 2440 | . . . 4 | |
2 | bi2.04 247 | . . . . 5 | |
3 | 2 | albii 1450 | . . . 4 |
4 | 1, 3 | bitri 183 | . . 3 |
5 | ra5.1 | . . . 4 | |
6 | 5 | stdpc5 1564 | . . 3 |
7 | 4, 6 | sylbi 120 | . 2 |
8 | df-ral 2440 | . 2 | |
9 | 7, 8 | syl6ibr 161 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wal 1333 wnf 1440 wcel 2128 wral 2435 |
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 1427 ax-gen 1429 ax-4 1490 ax-ial 1514 ax-i5r 1515 |
This theorem depends on definitions: df-bi 116 df-nf 1441 df-ral 2440 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |