Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2exnexn | Structured version Visualization version GIF version |
Description: Theorem *11.51 in [WhiteheadRussell] p. 164. (Contributed by Andrew Salmon, 24-May-2011.) (Proof shortened by Wolf Lammen, 25-Sep-2014.) |
Ref | Expression |
---|---|
2exnexn | ⊢ (∃𝑥∀𝑦𝜑 ↔ ¬ ∀𝑥∃𝑦 ¬ 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | alexn 1848 | . 2 ⊢ (∀𝑥∃𝑦 ¬ 𝜑 ↔ ¬ ∃𝑥∀𝑦𝜑) | |
2 | 1 | con2bii 357 | 1 ⊢ (∃𝑥∀𝑦𝜑 ↔ ¬ ∀𝑥∃𝑦 ¬ 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 205 ∀wal 1537 ∃wex 1783 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 |
This theorem depends on definitions: df-bi 206 df-ex 1784 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |