Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 19.41vvvv | Structured version Visualization version GIF version |
Description: Version of 19.41 2103 with four quantifiers and a dv condition requiring fewer axioms. (Contributed by FL, 14-Jul-2007.) |
Ref | Expression |
---|---|
19.41vvvv | ⊢ (∃𝑤∃𝑥∃𝑦∃𝑧(𝜑 ∧ 𝜓) ↔ (∃𝑤∃𝑥∃𝑦∃𝑧𝜑 ∧ 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 19.41vvv 1916 | . . 3 ⊢ (∃𝑥∃𝑦∃𝑧(𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦∃𝑧𝜑 ∧ 𝜓)) | |
2 | 1 | exbii 1774 | . 2 ⊢ (∃𝑤∃𝑥∃𝑦∃𝑧(𝜑 ∧ 𝜓) ↔ ∃𝑤(∃𝑥∃𝑦∃𝑧𝜑 ∧ 𝜓)) |
3 | 19.41v 1914 | . 2 ⊢ (∃𝑤(∃𝑥∃𝑦∃𝑧𝜑 ∧ 𝜓) ↔ (∃𝑤∃𝑥∃𝑦∃𝑧𝜑 ∧ 𝜓)) | |
4 | 2, 3 | bitri 264 | 1 ⊢ (∃𝑤∃𝑥∃𝑦∃𝑧(𝜑 ∧ 𝜓) ↔ (∃𝑤∃𝑥∃𝑦∃𝑧𝜑 ∧ 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∧ wa 384 ∃wex 1704 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 |
This theorem depends on definitions: df-bi 197 df-an 386 df-ex 1705 |
This theorem is referenced by: elfuns 32022 |
Copyright terms: Public domain | W3C validator |