Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 19.12vv | Structured version Visualization version GIF version |
Description: Special case of 19.12 2346 where its converse holds. See 19.12vvv 1995 for a version with a disjoint variable condition requiring fewer axioms. (Contributed by NM, 18-Jul-2001.) (Revised by Andrew Salmon, 11-Jul-2011.) |
Ref | Expression |
---|---|
19.12vv | ⊢ (∃𝑥∀𝑦(𝜑 → 𝜓) ↔ ∀𝑦∃𝑥(𝜑 → 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 19.21v 1940 | . . 3 ⊢ (∀𝑦(𝜑 → 𝜓) ↔ (𝜑 → ∀𝑦𝜓)) | |
2 | 1 | exbii 1848 | . 2 ⊢ (∃𝑥∀𝑦(𝜑 → 𝜓) ↔ ∃𝑥(𝜑 → ∀𝑦𝜓)) |
3 | nfv 1915 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
4 | 3 | nfal 2342 | . . 3 ⊢ Ⅎ𝑥∀𝑦𝜓 |
5 | 4 | 19.36 2232 | . 2 ⊢ (∃𝑥(𝜑 → ∀𝑦𝜓) ↔ (∀𝑥𝜑 → ∀𝑦𝜓)) |
6 | 19.36v 1994 | . . . 4 ⊢ (∃𝑥(𝜑 → 𝜓) ↔ (∀𝑥𝜑 → 𝜓)) | |
7 | 6 | albii 1820 | . . 3 ⊢ (∀𝑦∃𝑥(𝜑 → 𝜓) ↔ ∀𝑦(∀𝑥𝜑 → 𝜓)) |
8 | nfv 1915 | . . . . 5 ⊢ Ⅎ𝑦𝜑 | |
9 | 8 | nfal 2342 | . . . 4 ⊢ Ⅎ𝑦∀𝑥𝜑 |
10 | 9 | 19.21 2207 | . . 3 ⊢ (∀𝑦(∀𝑥𝜑 → 𝜓) ↔ (∀𝑥𝜑 → ∀𝑦𝜓)) |
11 | 7, 10 | bitr2i 278 | . 2 ⊢ ((∀𝑥𝜑 → ∀𝑦𝜓) ↔ ∀𝑦∃𝑥(𝜑 → 𝜓)) |
12 | 2, 5, 11 | 3bitri 299 | 1 ⊢ (∃𝑥∀𝑦(𝜑 → 𝜓) ↔ ∀𝑦∃𝑥(𝜑 → 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∀wal 1535 ∃wex 1780 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-10 2145 ax-11 2161 ax-12 2177 |
This theorem depends on definitions: df-bi 209 df-ex 1781 df-nf 1785 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |