| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 19.41vv | Structured version Visualization version GIF version | ||
| Description: Version of 19.41 2247 with two quantifiers and a disjoint variable condition requiring fewer axioms. (Contributed by NM, 30-Apr-1995.) |
| Ref | Expression |
|---|---|
| 19.41vv | ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 19.41v 1956 | . . 3 ⊢ (∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑦𝜑 ∧ 𝜓)) | |
| 2 | 1 | exbii 1855 | . 2 ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ ∃𝑥(∃𝑦𝜑 ∧ 𝜓)) |
| 3 | 19.41v 1956 | . 2 ⊢ (∃𝑥(∃𝑦𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ 𝜓)) | |
| 4 | 2, 3 | bitri 276 | 1 ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 207 ∧ wa 396 ∃wex 1786 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-ex 1787 |
| This theorem is referenced by: 19.41vvv 1958 cgsex4g 3479 rabxp 5673 copsex2gb 5756 mpomptx 7476 xpassen 9006 dfac5lem1 10043 fusgr2wsp2nb 30429 bnj996 35145 dfdm5 36008 dfrn5 36009 elima4 36011 brtxp2 36114 brpprod3a 36119 brimg 36170 lemsuccf 36174 brxrn2 38758 diblsmopel 41670 en2pr 43998 mpomptx2 48833 |
| Copyright terms: Public domain | W3C validator |