Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > r19.32v | Structured version Visualization version GIF version |
Description: Restricted quantifier version of 19.32v 1856. (Contributed by NM, 25-Nov-2003.) |
Ref | Expression |
---|---|
r19.32v | ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∀𝑥 ∈ 𝐴 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | r19.21v 2943 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (¬ 𝜑 → 𝜓) ↔ (¬ 𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) | |
2 | df-or 384 | . . 3 ⊢ ((𝜑 ∨ 𝜓) ↔ (¬ 𝜑 → 𝜓)) | |
3 | 2 | ralbii 2963 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ ∀𝑥 ∈ 𝐴 (¬ 𝜑 → 𝜓)) |
4 | df-or 384 | . 2 ⊢ ((𝜑 ∨ ∀𝑥 ∈ 𝐴 𝜓) ↔ (¬ 𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) | |
5 | 1, 3, 4 | 3bitr4i 291 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∀𝑥 ∈ 𝐴 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 195 ∨ wo 382 ∀wral 2896 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 |
This theorem depends on definitions: df-bi 196 df-or 384 df-ex 1696 df-ral 2901 |
This theorem is referenced by: iinun2 4522 iinuni 4545 axcontlem2 25645 axcontlem7 25650 disjnf 28766 lindslinindsimp2 42046 |
Copyright terms: Public domain | W3C validator |