| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > r19.43 | GIF version | ||
| Description: Restricted version of Theorem 19.43 of [Margaris] p. 90. (Contributed by NM, 27-May-1998.) (Proof rewritten by Jim Kingdon, 5-Jun-2018.) |
| Ref | Expression |
|---|---|
| r19.43 | ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rex 2481 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ (𝜑 ∨ 𝜓))) | |
| 2 | andi 819 | . . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝜑 ∨ 𝜓)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜓))) | |
| 3 | 2 | exbii 1619 | . . . 4 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ (𝜑 ∨ 𝜓)) ↔ ∃𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜓))) |
| 4 | 1, 3 | bitri 184 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ ∃𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜓))) |
| 5 | 19.43 1642 | . . 3 ⊢ (∃𝑥((𝑥 ∈ 𝐴 ∧ 𝜑) ∨ (𝑥 ∈ 𝐴 ∧ 𝜓)) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∨ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))) | |
| 6 | 4, 5 | bitri 184 | . 2 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∨ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))) |
| 7 | df-rex 2481 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 8 | df-rex 2481 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜓 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓)) | |
| 9 | 7, 8 | orbi12i 765 | . 2 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓) ↔ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∨ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜓))) |
| 10 | 6, 9 | bitr4i 187 | 1 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 ∨ wo 709 ∃wex 1506 ∈ wcel 2167 ∃wrex 2476 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1461 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-4 1524 ax-ial 1548 |
| This theorem depends on definitions: df-bi 117 df-rex 2481 |
| This theorem is referenced by: r19.44av 2656 r19.45av 2657 r19.45mv 3544 r19.44mv 3545 iunun 3995 ltexprlemloc 7674 pythagtriplem2 12435 pythagtrip 12452 |
| Copyright terms: Public domain | W3C validator |