| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Axiom of Specialization.
A quantified wff implies the wff without a
quantifier (i.e. an instance, or special case, of the generalized wff).
In other words if something is true for all
Unlike the more general textbook Axiom of Specialization, we cannot
choose a variable different from An alternate axiomatization could use ax467 1023 and ax-5o 975 in place of ax-4 973, ax-5o 975, ax-6o 978, and ax-7 962. This axiom is redundant, as shown by theorem ax4 972. |
| Ref | Expression |
|---|---|
| ax-4 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | wph |
. . 3
| |
| 2 | vx |
. . 3
| |
| 3 | 1, 2 | wal 954 |
. 2
|
| 4 | 3, 1 | wi 3 |
1
|
| Colors of variables: wff set class |
| This axiom is referenced by: ax5o 974 ax5 976 ax6o 977 ax6 979 a4i 982 a4s 984 a4sd 985 ax46 1017 ax67to6 1021 ax467 1023 19.8a 1029 19.3 1031 19.12 1047 19.21 1056 19.21bi 1060 19.38 1081 19.21t 1115 19.23t 1116 hbae 1145 equs4 1150 sb2 1177 sbied 1195 ax11 1219 ax11b 1220 dfsb2 1225 hbsb4 1248 hbsb4t 1249 sb56 1266 sb6 1267 a16gb 1277 sbal1 1346 ax11indalem 1368 ax11inda2ALT 1369 mopick 1433 2eu1 1449 ra4 1694 ralcom2 1776 ceqex 1886 abidhb 1912 hbsbc1gd 1983 hbsbcgd 1984 disjssun 2326 intab 2560 axrep1 2694 axrep2 2695 axnul2 2708 dtruALT 2748 ssopab2 2822 alxfr 2896 fununi 3563 hbfvd2 3731 fiint 4559 fiintOLD 4560 nd3 4940 axrepndlem2 4945 axrepnd 4946 axpowndlem2 4950 axpowndlem4 4952 axinfndlem1 4957 axacndlem4 4962 axacndlem5 4963 suppsrlem 5221 cncnplem2 7775 imonclem 10741 |