| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 2moexv | Structured version Visualization version GIF version | ||
| Description: Double quantification with "at most one". (Contributed by NM, 3-Dec-2001.) |
| Ref | Expression |
|---|---|
| 2moexv | ⊢ (∃*𝑥∃𝑦𝜑 → ∀𝑦∃*𝑥𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfe1 2185 | . . 3 ⊢ Ⅎ𝑦∃𝑦𝜑 | |
| 2 | 1 | nfmov 2588 | . 2 ⊢ Ⅎ𝑦∃*𝑥∃𝑦𝜑 |
| 3 | 19.8a 2217 | . . 3 ⊢ (𝜑 → ∃𝑦𝜑) | |
| 4 | 3 | moimi 2573 | . 2 ⊢ (∃*𝑥∃𝑦𝜑 → ∃*𝑥𝜑) |
| 5 | 2, 4 | alrimi 2249 | 1 ⊢ (∃*𝑥∃𝑦𝜑 → ∀𝑦∃*𝑥𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1568 ∃wex 1809 ∃*wmo 2565 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-10 2176 ax-11 2192 ax-12 2213 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-ex 1810 df-nf 1814 df-mo 2567 |
| This theorem is referenced by: 2eu5 2683 |
| Copyright terms: Public domain | W3C validator |