Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2nexaln | Structured version Visualization version GIF version |
Description: Theorem *11.25 in [WhiteheadRussell] p. 160. (Contributed by Andrew Salmon, 24-May-2011.) |
Ref | Expression |
---|---|
2nexaln | ⊢ (¬ ∃𝑥∃𝑦𝜑 ↔ ∀𝑥∀𝑦 ¬ 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2exnaln 1756 | . . 3 ⊢ (∃𝑥∃𝑦𝜑 ↔ ¬ ∀𝑥∀𝑦 ¬ 𝜑) | |
2 | 1 | bicomi 214 | . 2 ⊢ (¬ ∀𝑥∀𝑦 ¬ 𝜑 ↔ ∃𝑥∃𝑦𝜑) |
3 | 2 | con1bii 346 | 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: 2mo 2551 bj-alcomexcom 32670 pm11.63 38595 fun2dmnopgexmpl 41303 spr0nelg 41726 |
Copyright terms: Public domain | W3C validator |