| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > r19.27zv | Structured version Visualization version GIF version | ||
| Description: Restricted quantifier version of Theorem 19.27 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.27zv | ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ 𝜓))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1951 | . 2 ⊢ Ⅎ𝑥𝜓 | |
| 2 | 1 | r19.27z 4468 | 1 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ 𝜓))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ≠ wne 2962 ∀wral 3083 ∅c0 4280 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-9 2160 ax-12 2219 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-clab 2745 df-cleq 2758 df-ne 2963 df-ral 3084 df-dif 4049 df-nul 4281 |
| This theorem is used by: raaanv 4477 iindif1 5039 txflf 24382 dfso3 36701 dibglbN 42491 2alsraln0 51431 |
| Copyright terms: Public domain | W3C validator |