| 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 1943 | . 2 ⊢ Ⅎ𝑥𝜓 | |
| 2 | 1 | r19.27z 4470 | 1 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 ∧ 𝜓))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 400 ≠ wne 2957 ∀wral 3078 ∅c0 4285 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-9 2152 ax-12 2212 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-clab 2741 df-cleq 2754 df-ne 2958 df-ral 3079 df-dif 3907 df-nul 4286 |
| This theorem is used by: raaanv 4479 iindif1 5040 txflf 24174 dfso3 36220 dibglbN 41968 2alsraln0 50623 |
| Copyright terms: Public domain | W3C validator |