| 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 1946 | . 2 ⊢ Ⅎ𝑥𝜑 | |
| 2 | 1 | r19.28z 4457 | 1 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ≠ wne 2955 ∀wral 3076 ∅c0 4278 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-9 2154 ax-12 2212 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-clab 2739 df-cleq 2752 df-ne 2956 df-ral 3077 df-dif 4047 df-nul 4279 |
| This theorem is used by: raaanv 4474 raltpd 4741 iinrab 5026 iindif2 5036 iinin2 5037 reusv2lem5 5363 xpiindi 5811 dfpo2 6299 fint 6761 ixpiin 8952 neips 23431 txflf 24325 isclmp 25418 diaglbN 42113 dihglbcpreN 42358 2reuimp 48185 |
| Copyright terms: Public domain | W3C validator |