| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Theorem 19.2 of [Margaris] p. 89 with restricted quantifiers (compare 19.2 713). The restricted version is valid only when the domain of quantification is not empty. |
| Ref | Expression |
|---|---|
| r19.2z |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ral 1205 |
. . . 4
| |
| 2 | exintr 793 |
. . . 4
| |
| 3 | 1, 2 | sylbi 174 |
. . 3
|
| 4 | n0 1714 |
. . 3
| |
| 5 | df-rex 1206 |
. . 3
| |
| 6 | 3, 4, 5 | 3imtr4g 426 |
. 2
|
| 7 | 6 | com12 13 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: cfsuc 3709 |
| 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-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-ral 1205 df-rex 1206 df-v 1349 df-dif 1489 df-nul 1708 |