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 1932. (Contributed by NM, 25-Nov-2003.) |
Ref | Expression |
---|---|
r19.32v | ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∀𝑥 ∈ 𝐴 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | r19.21v 3172 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (¬ 𝜑 → 𝜓) ↔ (¬ 𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) | |
2 | df-or 842 | . . 3 ⊢ ((𝜑 ∨ 𝜓) ↔ (¬ 𝜑 → 𝜓)) | |
3 | 2 | ralbii 3162 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ ∀𝑥 ∈ 𝐴 (¬ 𝜑 → 𝜓)) |
4 | df-or 842 | . 2 ⊢ ((𝜑 ∨ ∀𝑥 ∈ 𝐴 𝜓) ↔ (¬ 𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) | |
5 | 1, 3, 4 | 3bitr4i 304 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓) ↔ (𝜑 ∨ ∀𝑥 ∈ 𝐴 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∨ wo 841 ∀wral 3135 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 |
This theorem depends on definitions: df-bi 208 df-or 842 df-ex 1772 df-ral 3140 |
This theorem is referenced by: iinun2 4986 iinuni 5011 axcontlem2 26678 axcontlem7 26683 disjnf 30248 lindslinindsimp2 44446 |
Copyright terms: Public domain | W3C validator |