Theorem setindf 16723

Description: Axiom of set-induction with a disjoint variable condition replaced with a nonfreeness hypothesis. (Contributed by BJ, 22-Nov-2019.)

Hypothesis

Ref	Expression
setindf.nf	⊢ Ⅎ𝑦𝜑

Assertion

Ref	Expression
setindf	⊢ (∀𝑥(∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑) → ∀𝑥𝜑)

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem setindf

Step	Hyp	Ref	Expression
1		setindft 16722	. 2 ⊢ (∀𝑥Ⅎ𝑦𝜑 → (∀𝑥(∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑) → ∀𝑥𝜑))
2		setindf.nf	. 2 ⊢ Ⅎ𝑦𝜑
3	1, 2	mpg 1500	1 ⊢ (∀𝑥(∀𝑦 ∈ 𝑥 [𝑦 / 𝑥]𝜑 → 𝜑) → ∀𝑥𝜑)

Syntax hints:   → wi 4  ∀wal 1396  Ⅎwnf 1509  [wsb 1811  ∀wral 2520

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214  ax-setind 4658

This theorem depends on definitions:  df-bi 117  df-nf 1510  df-sb 1812  df-cleq 2225  df-clel 2228  df-ral 2525

This theorem is referenced by: (None)