| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pm11.53v | Structured version Visualization version GIF version | ||
| Description: Version of pm11.53 2377 with a disjoint variable condition, requiring fewer axioms. (Contributed by BJ, 7-Mar-2020.) |
| Ref | Expression |
|---|---|
| pm11.53v | ⊢ (∀𝑥∀𝑦(𝜑 → 𝜓) ↔ (∃𝑥𝜑 → ∀𝑦𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 19.21v 1968 | . . 3 ⊢ (∀𝑦(𝜑 → 𝜓) ↔ (𝜑 → ∀𝑦𝜓)) | |
| 2 | 1 | albii 1848 | . 2 ⊢ (∀𝑥∀𝑦(𝜑 → 𝜓) ↔ ∀𝑥(𝜑 → ∀𝑦𝜓)) |
| 3 | 19.23v 1971 | . 2 ⊢ (∀𝑥(𝜑 → ∀𝑦𝜓) ↔ (∃𝑥𝜑 → ∀𝑦𝜓)) | |
| 4 | 2, 3 | bitri 278 | 1 ⊢ (∀𝑥∀𝑦(𝜑 → 𝜓) ↔ (∃𝑥𝜑 → ∀𝑦𝜓)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1567 ∃wex 1808 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 |
| This proof depends on definitions: df-bi 210 df-ex 1809 |
| This theorem is used by: sbnf2 2389 |
| Copyright terms: Public domain | W3C validator |