Theorem 19.31v 1970

Description: Version of 19.31 2269 with a disjoint variable condition, requiring fewer axioms. (Contributed by BJ, 7-Mar-2020.)

Assertion

Ref	Expression
19.31v	⊢ (∀𝑥(𝜑 ∨ 𝜓) ↔ (∀𝑥𝜑 ∨ 𝜓))

Distinct variable group:   𝜓,𝑥

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem 19.31v

Step	Hyp	Ref	Expression
1		19.32v 1969	. 2 ⊢ (∀𝑥(𝜓 ∨ 𝜑) ↔ (𝜓 ∨ ∀𝑥𝜑))
2		orcom 883	. . 3 ⊢ ((𝜑 ∨ 𝜓) ↔ (𝜓 ∨ 𝜑))
3	2	albii 1848	. 2 ⊢ (∀𝑥(𝜑 ∨ 𝜓) ↔ ∀𝑥(𝜓 ∨ 𝜑))
4		orcom 883	. 2 ⊢ ((∀𝑥𝜑 ∨ 𝜓) ↔ (𝜓 ∨ ∀𝑥𝜑))
5	1, 3, 4	3bitr4i 306	1 ⊢ (∀𝑥(𝜑 ∨ 𝜓) ↔ (∀𝑥𝜑 ∨ 𝜓))

This proof depends on syntax axioms:   ↔ wb 209   ∨ wo 860  ∀wal 1567

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939

This proof depends on definitions:  df-bi 210  df-or 861  df-ex 1809

This theorem is used by:  19.31vv  45122