Theorem nfsb2or 1810

Description: Bound-variable hypothesis builder for substitution. Similar to hbsb2 1809 but in intuitionistic logic a disjunction is stronger than an implication. (Contributed by Jim Kingdon, 2-Feb-2018.)

Assertion

Ref	Expression
nfsb2or	⊢ (∀𝑥 𝑥 = 𝑦 ∨ Ⅎ𝑥[𝑦 / 𝑥]𝜑)

Proof of Theorem nfsb2or

Step	Hyp	Ref	Expression
1		sb4or 1806	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 ∨ ∀𝑥([𝑦 / 𝑥]𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)))
2		sb2 1741	. . . . . . 7 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → [𝑦 / 𝑥]𝜑)
3	2	a5i 1523	. . . . . 6 ⊢ (∀𝑥(𝑥 = 𝑦 → 𝜑) → ∀𝑥[𝑦 / 𝑥]𝜑)
4	3	imim2i 12	. . . . 5 ⊢ (([𝑦 / 𝑥]𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) → ([𝑦 / 𝑥]𝜑 → ∀𝑥[𝑦 / 𝑥]𝜑))
5	4	alimi 1432	. . . 4 ⊢ (∀𝑥([𝑦 / 𝑥]𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) → ∀𝑥([𝑦 / 𝑥]𝜑 → ∀𝑥[𝑦 / 𝑥]𝜑))
6		df-nf 1438	. . . 4 ⊢ (Ⅎ𝑥[𝑦 / 𝑥]𝜑 ↔ ∀𝑥([𝑦 / 𝑥]𝜑 → ∀𝑥[𝑦 / 𝑥]𝜑))
7	5, 6	sylibr 133	. . 3 ⊢ (∀𝑥([𝑦 / 𝑥]𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) → Ⅎ𝑥[𝑦 / 𝑥]𝜑)
8	7	orim2i 751	. 2 ⊢ ((∀𝑥 𝑥 = 𝑦 ∨ ∀𝑥([𝑦 / 𝑥]𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) → (∀𝑥 𝑥 = 𝑦 ∨ Ⅎ𝑥[𝑦 / 𝑥]𝜑))
9	1, 8	ax-mp 5	1 ⊢ (∀𝑥 𝑥 = 𝑦 ∨ Ⅎ𝑥[𝑦 / 𝑥]𝜑)

Syntax hints:   → wi 4   ∨ wo 698  ∀wal 1330  Ⅎwnf 1437  [wsb 1736

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516

This theorem depends on definitions:  df-bi 116  df-nf 1438  df-sb 1737

This theorem is referenced by:  sbequi  1812