Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 19.41vvv | Structured version Visualization version GIF version |
Description: Version of 19.41 2232 with three quantifiers and a disjoint variable condition requiring fewer axioms. (Contributed by NM, 30-Apr-1995.) |
Ref | Expression |
---|---|
19.41vvv | ⊢ (∃𝑥∃𝑦∃𝑧(𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦∃𝑧𝜑 ∧ 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 19.41vv 1947 | . . 3 ⊢ (∃𝑦∃𝑧(𝜑 ∧ 𝜓) ↔ (∃𝑦∃𝑧𝜑 ∧ 𝜓)) | |
2 | 1 | exbii 1844 | . 2 ⊢ (∃𝑥∃𝑦∃𝑧(𝜑 ∧ 𝜓) ↔ ∃𝑥(∃𝑦∃𝑧𝜑 ∧ 𝜓)) |
3 | 19.41v 1946 | . 2 ⊢ (∃𝑥(∃𝑦∃𝑧𝜑 ∧ 𝜓) ↔ (∃𝑥∃𝑦∃𝑧𝜑 ∧ 𝜓)) | |
4 | 2, 3 | bitri 277 | 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 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1777 |
This theorem is referenced by: 19.41vvvv 1949 eloprabga 7255 dftpos3 7904 |
Copyright terms: Public domain | W3C validator |