| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Restricted quantifier version of Axiom 4 of [Mendelson] p. 59. This is an axiom of a predicate calculus for a restricted domain. Compare the unrestricted stdpc4 869. |
| Ref | Expression |
|---|---|
| rax4 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | a4sbc 1444 |
. . . . 5
| |
| 2 | df-ral 1205 |
. . . . 5
| |
| 3 | 1, 2 | syl5ib 181 |
. . . 4
|
| 4 | sbcim 1460 |
. . . 4
| |
| 5 | 3, 4 | sylibd 177 |
. . 3
|
| 6 | sbcel1 1466 |
. . . 4
| |
| 7 | 6 | imbi1d 465 |
. . 3
|
| 8 | 5, 7 | sylibd 177 |
. 2
|
| 9 | 8 | pm2.43a 60 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-16 922 ax-17 925 ax-ext 1074 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-ral 1205 df-v 1349 df-sbc 1441 |