Theorem bj-nnford 34961

Description: Nonfreeness in both disjuncts implies nonfreeness in the disjunction, deduction form. See comments for bj-nnfor 34960 and bj-nnfand 34959. (Contributed by BJ, 2-Dec-2023.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
bj-nnford.1	⊢ (𝜑 → Ⅎ'𝑥𝜓)
bj-nnford.2	⊢ (𝜑 → Ⅎ'𝑥𝜒)

Assertion

Ref	Expression
bj-nnford	⊢ (𝜑 → Ⅎ'𝑥(𝜓 ∨ 𝜒))

Proof of Theorem bj-nnford

Step	Hyp	Ref	Expression
1		19.43 1881	. . 3 ⊢ (∃𝑥(𝜓 ∨ 𝜒) ↔ (∃𝑥𝜓 ∨ ∃𝑥𝜒))
2		bj-nnford.1	. . . . 5 ⊢ (𝜑 → Ⅎ'𝑥𝜓)
3	2	bj-nnfed 34942	. . . 4 ⊢ (𝜑 → (∃𝑥𝜓 → 𝜓))
4		bj-nnford.2	. . . . 5 ⊢ (𝜑 → Ⅎ'𝑥𝜒)
5	4	bj-nnfed 34942	. . . 4 ⊢ (𝜑 → (∃𝑥𝜒 → 𝜒))
6	3, 5	orim12d 961	. . 3 ⊢ (𝜑 → ((∃𝑥𝜓 ∨ ∃𝑥𝜒) → (𝜓 ∨ 𝜒)))
7	1, 6	syl5bi 241	. 2 ⊢ (𝜑 → (∃𝑥(𝜓 ∨ 𝜒) → (𝜓 ∨ 𝜒)))
8	2	bj-nnfad 34939	. . . 4 ⊢ (𝜑 → (𝜓 → ∀𝑥𝜓))
9	4	bj-nnfad 34939	. . . 4 ⊢ (𝜑 → (𝜒 → ∀𝑥𝜒))
10	8, 9	orim12d 961	. . 3 ⊢ (𝜑 → ((𝜓 ∨ 𝜒) → (∀𝑥𝜓 ∨ ∀𝑥𝜒)))
11		19.33 1883	. . 3 ⊢ ((∀𝑥𝜓 ∨ ∀𝑥𝜒) → ∀𝑥(𝜓 ∨ 𝜒))
12	10, 11	syl6 35	. 2 ⊢ (𝜑 → ((𝜓 ∨ 𝜒) → ∀𝑥(𝜓 ∨ 𝜒)))
13		df-bj-nnf 34934	. 2 ⊢ (Ⅎ'𝑥(𝜓 ∨ 𝜒) ↔ ((∃𝑥(𝜓 ∨ 𝜒) → (𝜓 ∨ 𝜒)) ∧ ((𝜓 ∨ 𝜒) → ∀𝑥(𝜓 ∨ 𝜒))))
14	7, 12, 13	sylanbrc 582	1 ⊢ (𝜑 → Ⅎ'𝑥(𝜓 ∨ 𝜒))

Syntax hints:   → wi 4   ∨ wo 843  ∀wal 1535  ∃wex 1777  Ⅎ'wnnf 34933

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

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-ex 1778  df-bj-nnf 34934

This theorem is referenced by: (None)