| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 19.32v | Structured version Visualization version GIF version | ||
| Description: Version of 19.32 2272 with a disjoint variable condition, requiring fewer axioms. (Contributed by BJ, 7-Mar-2020.) |
| Ref | Expression |
|---|---|
| 19.32v | ⊢ (∀𝑥(𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∀𝑥𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 19.21v 1972 | . 2 ⊢ (∀𝑥(¬ 𝜑 → 𝜓) ↔ (¬ 𝜑 → ∀𝑥𝜓)) | |
| 2 | df-or 862 | . . 3 ⊢ ((𝜑 ∨ 𝜓) ↔ (¬ 𝜑 → 𝜓)) | |
| 3 | 2 | albii 1852 | . 2 ⊢ (∀𝑥(𝜑 ∨ 𝜓) ↔ ∀𝑥(¬ 𝜑 → 𝜓)) |
| 4 | df-or 862 | . 2 ⊢ ((𝜑 ∨ ∀𝑥𝜓) ↔ (¬ 𝜑 → ∀𝑥𝜓)) | |
| 5 | 1, 3, 4 | 3bitr4i 306 | 1 ⊢ (∀𝑥(𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∀𝑥𝜓)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∨ wo 861 ∀wal 1568 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 |
| This proof depends on definitions: df-bi 210 df-or 862 df-ex 1813 |
| This theorem is used by: 19.31v 1974 iresn0n0 6058 pm10.12 45145 |
| Copyright terms: Public domain | W3C validator |