| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > r19.28zv | Structured version Visualization version GIF version | ||
| Description: Restricted quantifier version of Theorem 19.28 of [Margaris] p. 90. It is valid only when the domain of quantification is not empty. (Contributed by NM, 19-Aug-2004.) |
| Ref | Expression |
|---|---|
| r19.28zv | ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1947 | . 2 ⊢ Ⅎ𝑥𝜑 | |
| 2 | 1 | r19.28z 4458 | 1 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ≠ wne 2955 ∀wral 3076 ∅c0 4279 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-9 2155 ax-12 2213 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2739 df-cleq 2752 df-ne 2956 df-ral 3077 df-dif 3902 df-nul 4280 |
| This theorem is used by: raaanv 4475 raltpd 4742 iinrab 5027 iindif2 5037 iinin2 5038 reusv2lem5 5364 xpiindi 5809 dfpo2 6289 fint 6750 ixpiin 8931 neips 23378 txflf 24272 isclmp 25365 diaglbN 42026 dihglbcpreN 42271 2reuimp 48101 |
| Copyright terms: Public domain | W3C validator |