| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 19.45v | Structured version Visualization version GIF version | ||
| Description: Version of 19.45 2272 with a disjoint variable condition, requiring fewer axioms. (Contributed by NM, 12-Mar-1993.) |
| Ref | Expression |
|---|---|
| 19.45v | ⊢ (∃𝑥(𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∃𝑥𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 19.43 1901 | . 2 ⊢ (∃𝑥(𝜑 ∨ 𝜓) ↔ (∃𝑥𝜑 ∨ ∃𝑥𝜓)) | |
| 2 | 19.9v 2003 | . . 3 ⊢ (∃𝑥𝜑 ↔ 𝜑) | |
| 3 | 2 | orbi1i 924 | . 2 ⊢ ((∃𝑥𝜑 ∨ ∃𝑥𝜓) ↔ (𝜑 ∨ ∃𝑥𝜓)) |
| 4 | 1, 3 | bitri 277 | 1 ⊢ (∃𝑥(𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∃𝑥𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∨ wo 858 ∃wex 1798 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 |
| This theorem depends on definitions: df-bi 209 df-or 859 df-ex 1799 |
| This theorem is referenced by: satfvsucsuc 35676 mosssn2 49399 |
| Copyright terms: Public domain | W3C validator |