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 1911 | . 2 ⊢ Ⅎ𝑥𝜑 | |
2 | 1 | r19.28z 4442 | 1 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 (𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∀𝑥 ∈ 𝐴 𝜓))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ≠ wne 3016 ∀wral 3138 ∅c0 4290 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-11 2157 ax-12 2173 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-dif 3938 df-nul 4291 |
This theorem is referenced by: raaanv 4460 raltpd 4715 iinrab 4990 iindif2 4998 iinin2 4999 reusv2lem5 5302 xpiindi 5705 fint 6557 ixpiin 8487 neips 21720 txflf 22613 isclmp 23700 dfpo2 32991 diaglbN 38190 dihglbcpreN 38435 2reuimp 43313 |
Copyright terms: Public domain | W3C validator |