Theorem bj-nnfor 36752

Description: Nonfreeness in both disjuncts implies nonfreeness in the disjunction. (Contributed by BJ, 19-Nov-2023.) In classical logic, there is a proof using the definition of disjunction in terms of implication and negation, so using bj-nnfim 36748, bj-nnfnt 36742 and bj-nnfbi 36727, but we want a proof valid in intuitionistic logic. (Proof modification is discouraged.)

Assertion

Ref	Expression
bj-nnfor	⊢ ((Ⅎ'𝑥𝜑 ∧ Ⅎ'𝑥𝜓) → Ⅎ'𝑥(𝜑 ∨ 𝜓))

Proof of Theorem bj-nnfor

Step	Hyp	Ref	Expression
1		df-bj-nnf 36726	. . 3 ⊢ (Ⅎ'𝑥𝜑 ↔ ((∃𝑥𝜑 → 𝜑) ∧ (𝜑 → ∀𝑥𝜑)))
2		df-bj-nnf 36726	. . 3 ⊢ (Ⅎ'𝑥𝜓 ↔ ((∃𝑥𝜓 → 𝜓) ∧ (𝜓 → ∀𝑥𝜓)))
3		19.43 1881	. . . . . 6 ⊢ (∃𝑥(𝜑 ∨ 𝜓) ↔ (∃𝑥𝜑 ∨ ∃𝑥𝜓))
4		pm3.48 965	. . . . . 6 ⊢ (((∃𝑥𝜑 → 𝜑) ∧ (∃𝑥𝜓 → 𝜓)) → ((∃𝑥𝜑 ∨ ∃𝑥𝜓) → (𝜑 ∨ 𝜓)))
5	3, 4	biimtrid 242	. . . . 5 ⊢ (((∃𝑥𝜑 → 𝜑) ∧ (∃𝑥𝜓 → 𝜓)) → (∃𝑥(𝜑 ∨ 𝜓) → (𝜑 ∨ 𝜓)))
6		pm3.48 965	. . . . . 6 ⊢ (((𝜑 → ∀𝑥𝜑) ∧ (𝜓 → ∀𝑥𝜓)) → ((𝜑 ∨ 𝜓) → (∀𝑥𝜑 ∨ ∀𝑥𝜓)))
7		19.33 1883	. . . . . 6 ⊢ ((∀𝑥𝜑 ∨ ∀𝑥𝜓) → ∀𝑥(𝜑 ∨ 𝜓))
8	6, 7	syl6 35	. . . . 5 ⊢ (((𝜑 → ∀𝑥𝜑) ∧ (𝜓 → ∀𝑥𝜓)) → ((𝜑 ∨ 𝜓) → ∀𝑥(𝜑 ∨ 𝜓)))
9	5, 8	anim12i 613	. . . 4 ⊢ ((((∃𝑥𝜑 → 𝜑) ∧ (∃𝑥𝜓 → 𝜓)) ∧ ((𝜑 → ∀𝑥𝜑) ∧ (𝜓 → ∀𝑥𝜓))) → ((∃𝑥(𝜑 ∨ 𝜓) → (𝜑 ∨ 𝜓)) ∧ ((𝜑 ∨ 𝜓) → ∀𝑥(𝜑 ∨ 𝜓))))
10	9	an4s 660	. . 3 ⊢ ((((∃𝑥𝜑 → 𝜑) ∧ (𝜑 → ∀𝑥𝜑)) ∧ ((∃𝑥𝜓 → 𝜓) ∧ (𝜓 → ∀𝑥𝜓))) → ((∃𝑥(𝜑 ∨ 𝜓) → (𝜑 ∨ 𝜓)) ∧ ((𝜑 ∨ 𝜓) → ∀𝑥(𝜑 ∨ 𝜓))))
11	1, 2, 10	syl2anb 598	. 2 ⊢ ((Ⅎ'𝑥𝜑 ∧ Ⅎ'𝑥𝜓) → ((∃𝑥(𝜑 ∨ 𝜓) → (𝜑 ∨ 𝜓)) ∧ ((𝜑 ∨ 𝜓) → ∀𝑥(𝜑 ∨ 𝜓))))
12		df-bj-nnf 36726	. 2 ⊢ (Ⅎ'𝑥(𝜑 ∨ 𝜓) ↔ ((∃𝑥(𝜑 ∨ 𝜓) → (𝜑 ∨ 𝜓)) ∧ ((𝜑 ∨ 𝜓) → ∀𝑥(𝜑 ∨ 𝜓))))
13	11, 12	sylibr 234	1 ⊢ ((Ⅎ'𝑥𝜑 ∧ Ⅎ'𝑥𝜓) → Ⅎ'𝑥(𝜑 ∨ 𝜓))

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 847  ∀wal 1537  ∃wex 1778  Ⅎ'wnnf 36725

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-ex 1779  df-bj-nnf 36726

This theorem is referenced by: (None)