Theorem r19.32vr 2699

Description: One direction of Theorem 19.32 of [Margaris] p. 90 with restricted quantifiers. For decidable propositions this is an equivalence, as seen at r19.32vdc 2700. (Contributed by Jim Kingdon, 19-Aug-2018.)

Assertion

Ref	Expression
r19.32vr	⊢ ((𝜑 ∨ ∀𝑥 ∈ 𝐴 𝜓) → ∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓))

Distinct variable group:   𝜑,𝑥

Allowed substitution hints:   𝜓(𝑥)   𝐴(𝑥)

Proof of Theorem r19.32vr

Step	Hyp	Ref	Expression
1		nfv 1581	. 2 ⊢ Ⅎ𝑥𝜑
2	1	r19.32r 2697	1 ⊢ ((𝜑 ∨ ∀𝑥 ∈ 𝐴 𝜓) → ∀𝑥 ∈ 𝐴 (𝜑 ∨ 𝜓))

This proof depends on syntax axioms:   → wi 4   ∨ wo 720  ∀wral 2528

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-gen 1502  ax-4 1563  ax-17 1579

This proof depends on definitions:  df-bi 117  df-nf 1514  df-ral 2533

This theorem is used by:  iinuniss  4095