| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 19.42vvv | Structured version Visualization version GIF version | ||
| Description: Version of 19.42 2271 with three quantifiers and a disjoint variable condition requiring fewer axioms. (Contributed by NM, 21-Sep-2011.) (Proof shortened by Wolf Lammen, 27-Aug-2023.) |
| Ref | Expression |
|---|---|
| 19.42vvv | ⊢ (∃𝑥∃𝑦∃𝑧(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃𝑥∃𝑦∃𝑧𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | exdistr2 1987 | . 2 ⊢ (∃𝑥∃𝑦∃𝑧(𝜑 ∧ 𝜓) ↔ ∃𝑥(𝜑 ∧ ∃𝑦∃𝑧𝜓)) | |
| 2 | 19.42v 1982 | . 2 ⊢ (∃𝑥(𝜑 ∧ ∃𝑦∃𝑧𝜓) ↔ (𝜑 ∧ ∃𝑥∃𝑦∃𝑧𝜓)) | |
| 3 | 1, 2 | bitri 278 | 1 ⊢ (∃𝑥∃𝑦∃𝑧(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃𝑥∃𝑦∃𝑧𝜓)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 400 ∃wex 1808 |
| 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 |
| This proof depends on definitions: df-bi 210 df-an 401 df-ex 1809 |
| This theorem is used by: ceqsex6v 3508 |
| Copyright terms: Public domain | W3C validator |