| 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 2243 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 1951 | . . 3 ⊢ (∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑦𝜑 ∧ 𝜓)) | |
| 2 | 1 | exbii 1850 | . 2 ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ ∃𝑥(∃𝑦𝜑 ∧ 𝜓)) |
| 3 | 19.41v 1951 | . 2 ⊢ (∃𝑥(∃𝑦𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ 𝜓)) | |
| 4 | 2, 3 | bitri 275 | 1 ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦𝜑 ∧ 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∃wex 1781 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1782 |
| This theorem is referenced by: 19.41vvv 1953 cgsex4g 3476 rabxp 5679 copsex2gb 5762 mpomptx 7480 xpassen 9009 dfac5lem1 10045 fusgr2wsp2nb 30404 bnj996 35098 dfdm5 35955 dfrn5 35956 elima4 35958 brtxp2 36061 brpprod3a 36066 brimg 36117 lemsuccf 36121 brxrn2 38705 diblsmopel 41617 en2pr 43974 mpomptx2 48811 |
| Copyright terms: Public domain | W3C validator |