Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2exnaln | Structured version Visualization version GIF version |
Description: Theorem *11.22 in [WhiteheadRussell] p. 160. (Contributed by Andrew Salmon, 24-May-2011.) |
Ref | Expression |
---|---|
2exnaln | ⊢ (∃𝑥∃𝑦𝜑 ↔ ¬ ∀𝑥∀𝑦 ¬ 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ex 1705 | . 2 ⊢ (∃𝑥∃𝑦𝜑 ↔ ¬ ∀𝑥 ¬ ∃𝑦𝜑) | |
2 | alnex 1706 | . . 3 ⊢ (∀𝑦 ¬ 𝜑 ↔ ¬ ∃𝑦𝜑) | |
3 | 2 | albii 1747 | . 2 ⊢ (∀𝑥∀𝑦 ¬ 𝜑 ↔ ∀𝑥 ¬ ∃𝑦𝜑) |
4 | 1, 3 | xchbinxr 325 | 1 ⊢ (∃𝑥∃𝑦𝜑 ↔ ¬ ∀𝑥∀𝑦 ¬ 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 196 ∀wal 1481 ∃wex 1704 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 |
This theorem depends on definitions: df-bi 197 df-ex 1705 |
This theorem is referenced by: 2nexaln 1757 excom 2042 cbvex2 2280 opab0 5007 bj-modal4e 32705 bj-cbvex2v 32738 |
Copyright terms: Public domain | W3C validator |