Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2moex | Structured version Visualization version GIF version |
Description: Double quantification with "at most one." (Contributed by NM, 3-Dec-2001.) |
Ref | Expression |
---|---|
2moex | ⊢ (∃*𝑥∃𝑦𝜑 → ∀𝑦∃*𝑥𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfe1 2014 | . . 3 ⊢ Ⅎ𝑦∃𝑦𝜑 | |
2 | 1 | nfmo 2475 | . 2 ⊢ Ⅎ𝑦∃*𝑥∃𝑦𝜑 |
3 | 19.8a 2039 | . . 3 ⊢ (𝜑 → ∃𝑦𝜑) | |
4 | 3 | moimi 2508 | . 2 ⊢ (∃*𝑥∃𝑦𝜑 → ∃*𝑥𝜑) |
5 | 2, 4 | alrimi 2069 | 1 ⊢ (∃*𝑥∃𝑦𝜑 → ∀𝑦∃*𝑥𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1473 ∃wex 1695 ∃*wmo 2459 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-tru 1478 df-ex 1696 df-nf 1701 df-eu 2462 df-mo 2463 |
This theorem is referenced by: 2eu2 2542 2eu5 2545 |
Copyright terms: Public domain | W3C validator |