| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2moswapv | Structured version Visualization version GIF version | ||
| Description: A condition allowing to swap an existential quantifier and at at-most-one quantifier. Version of 2moswap 2670 with a disjoint variable condition, which does not require ax-13 2402. (Contributed by NM, 10-Apr-2004.) (Revised by GG, 22-Aug-2023.) Factor out common proof lines with moexexvw 2654. (Revised by Wolf Lammen, 2-Oct-2023.) |
| Ref | Expression |
|---|---|
| 2moswapv | ⊢ (∀𝑥∃*𝑦𝜑 → (∃*𝑥∃𝑦𝜑 → ∃*𝑦∃𝑥𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfe1 2183 | . . . 4 ⊢ Ⅎ𝑦∃𝑦𝜑 | |
| 2 | 1 | nfmov 2586 | . . . 4 ⊢ Ⅎ𝑦∃*𝑥∃𝑦𝜑 |
| 3 | nfe1 2183 | . . . . 5 ⊢ Ⅎ𝑥∃𝑥(∃𝑦𝜑 ∧ 𝜑) | |
| 4 | 3 | nfmov 2586 | . . . 4 ⊢ Ⅎ𝑥∃*𝑦∃𝑥(∃𝑦𝜑 ∧ 𝜑) |
| 5 | 1, 2, 4 | moexexlem 2652 | . . 3 ⊢ ((∃*𝑥∃𝑦𝜑 ∧ ∀𝑥∃*𝑦𝜑) → ∃*𝑦∃𝑥(∃𝑦𝜑 ∧ 𝜑)) |
| 6 | 5 | expcom 418 | . 2 ⊢ (∀𝑥∃*𝑦𝜑 → (∃*𝑥∃𝑦𝜑 → ∃*𝑦∃𝑥(∃𝑦𝜑 ∧ 𝜑))) |
| 7 | 19.8a 2215 | . . . . 5 ⊢ (𝜑 → ∃𝑦𝜑) | |
| 8 | 7 | pm4.71ri 569 | . . . 4 ⊢ (𝜑 ↔ (∃𝑦𝜑 ∧ 𝜑)) |
| 9 | 8 | exbii 1876 | . . 3 ⊢ (∃𝑥𝜑 ↔ ∃𝑥(∃𝑦𝜑 ∧ 𝜑)) |
| 10 | 9 | mobii 2574 | . 2 ⊢ (∃*𝑦∃𝑥𝜑 ↔ ∃*𝑦∃𝑥(∃𝑦𝜑 ∧ 𝜑)) |
| 11 | 6, 10 | imbitrrdi 255 | 1 ⊢ (∀𝑥∃*𝑦𝜑 → (∃*𝑥∃𝑦𝜑 → ∃*𝑦∃𝑥𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∀wal 1566 ∃wex 1807 ∃*wmo 2563 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-10 2174 ax-11 2190 ax-12 2211 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1571 df-ex 1808 df-nf 1812 df-mo 2565 |
| This theorem is referenced by: 2euswapv 2656 2rmoswap 3723 |
| Copyright terms: Public domain | W3C validator |