Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eeanv | Structured version Visualization version GIF version |
Description: Distribute a pair of existential quantifiers over a conjunction. Combination of 19.41v 1946 and 19.42v 1950. For a version requiring fewer axioms but with additional disjoint variable conditions, see exdistrv 1952. (Contributed by NM, 26-Jul-1995.) |
Ref | Expression |
---|---|
eeanv | ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1911 | . 2 ⊢ Ⅎ𝑦𝜑 | |
2 | nfv 1911 | . 2 ⊢ Ⅎ𝑥𝜓 | |
3 | 1, 2 | eean 2365 | 1 ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 ∃wex 1776 |
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-10 2141 ax-11 2157 ax-12 2173 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ex 1777 df-nf 1781 |
This theorem is referenced by: eeeanv 2367 ee4anv 2368 |
Copyright terms: Public domain | W3C validator |