| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > r19.43 | Structured version Visualization version GIF version | ||
| Description: Restricted quantifier version of 19.43 1883. (Contributed by NM, 27-May-1998.) (Proof shortened by Andrew Salmon, 30-May-2011.) |
| Ref | Expression |
|---|---|
| r19.43 | ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r19.35 3090 | . 2 ⊢ (∃𝑥 ∈ 𝐴 (¬ 𝜑 → 𝜓) ↔ (∀𝑥 ∈ 𝐴 ¬ 𝜑 → ∃𝑥 ∈ 𝐴 𝜓)) | |
| 2 | df-or 848 | . . 3 ⊢ ((𝜑 ∨ 𝜓) ↔ (¬ 𝜑 → 𝜓)) | |
| 3 | 2 | rexbii 3079 | . 2 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ ∃𝑥 ∈ 𝐴 (¬ 𝜑 → 𝜓)) |
| 4 | df-or 848 | . . 3 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓) ↔ (¬ ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 𝜓)) | |
| 5 | ralnex 3058 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝜑 ↔ ¬ ∃𝑥 ∈ 𝐴 𝜑) | |
| 6 | 5 | imbi1i 349 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 ¬ 𝜑 → ∃𝑥 ∈ 𝐴 𝜓) ↔ (¬ ∃𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 𝜓)) |
| 7 | 4, 6 | bitr4i 278 | . 2 ⊢ ((∃𝑥 ∈ 𝐴 𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓) ↔ (∀𝑥 ∈ 𝐴 ¬ 𝜑 → ∃𝑥 ∈ 𝐴 𝜓)) |
| 8 | 1, 3, 7 | 3bitr4i 303 | 1 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 ∨ ∃𝑥 ∈ 𝐴 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∨ wo 847 ∀wral 3047 ∃wrex 3056 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ex 1781 df-ral 3048 df-rex 3057 |
| This theorem is referenced by: 3r19.43 3101 r19.45v 3166 r19.44v 3167 r19.45zv 4450 r19.44zv 4451 iunun 5039 soseq 8089 wemapsolem 9436 pythagtriplem2 16729 pythagtrip 16746 dcubic 26783 addsdilem1 28090 mulsasslem2 28103 legtrid 28569 axcontlem4 28945 erdszelem11 35245 satfvsucsuc 35409 fmla1 35431 seglelin 36160 hashnexinjle 42232 fimgmcyclem 42636 rexor 42771 diophun 42876 rexzrexnn0 42907 dfvopnbgr2 47963 dfsclnbgr6 47968 ldepslinc 48620 |
| Copyright terms: Public domain | W3C validator |