Theorem 19.32r 1639

Description: One direction of Theorem 19.32 of [Margaris] p. 90. The converse holds if 𝜑 is decidable, as seen at 19.32dc 1638. (Contributed by Jim Kingdon, 28-Jul-2018.)

Hypothesis

Ref	Expression
19.32r.1	⊢ Ⅎ𝑥𝜑

Assertion

Ref	Expression
19.32r	⊢ ((𝜑 ∨ ∀𝑥𝜓) → ∀𝑥(𝜑 ∨ 𝜓))

Proof of Theorem 19.32r

Step	Hyp	Ref	Expression
1		19.32r.1	. . 3 ⊢ Ⅎ𝑥𝜑
2		orc 684	. . 3 ⊢ (𝜑 → (𝜑 ∨ 𝜓))
3	1, 2	alrimi 1483	. 2 ⊢ (𝜑 → ∀𝑥(𝜑 ∨ 𝜓))
4		olc 683	. . 3 ⊢ (𝜓 → (𝜑 ∨ 𝜓))
5	4	alimi 1412	. 2 ⊢ (∀𝑥𝜓 → ∀𝑥(𝜑 ∨ 𝜓))
6	3, 5	jaoi 688	1 ⊢ ((𝜑 ∨ ∀𝑥𝜓) → ∀𝑥(𝜑 ∨ 𝜓))

Syntax hints:   → wi 4   ∨ wo 680  ∀wal 1310  Ⅎwnf 1417

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 681  ax-5 1404  ax-gen 1406  ax-4 1468

This theorem depends on definitions:  df-bi 116  df-nf 1418

This theorem is referenced by:  19.31r  1640