Theorem bj-nfcf 37586

Description: Version of df-nfc 2911 with a disjoint variable condition replaced with a nonfreeness hypothesis. (Contributed by BJ, 2-May-2019.)

Hypothesis

Ref	Expression
bj-nfcf.nf	⊢ Ⅎ𝑦𝐴

Assertion

Ref	Expression
bj-nfcf	⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝐴(𝑥, 𝑦)

Proof of Theorem bj-nfcf

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-nfc 2911	. 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴)
2		bj-nfcf.nf	. . . . . 6 ⊢ Ⅎ𝑦𝐴
3	2	nfcri 2916	. . . . 5 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐴
4	3	nfnf 2358	. . . 4 ⊢ Ⅎ𝑦Ⅎ𝑥 𝑧 ∈ 𝐴
5	4	sb8f 2385	. . 3 ⊢ (∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ ∀𝑦[𝑦 / 𝑧]Ⅎ𝑥 𝑧 ∈ 𝐴)
6		sbnf 2345	. . . . 5 ⊢ ([𝑦 / 𝑧]Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ Ⅎ𝑥[𝑦 / 𝑧]𝑧 ∈ 𝐴)
7		clelsb1 2889	. . . . . 6 ⊢ ([𝑦 / 𝑧]𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)
8	7	nfbii 1881	. . . . 5 ⊢ (Ⅎ𝑥[𝑦 / 𝑧]𝑧 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐴)
9	6, 8	bitri 278	. . . 4 ⊢ ([𝑦 / 𝑧]Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐴)
10	9	albii 1848	. . 3 ⊢ (∀𝑦[𝑦 / 𝑧]Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
11	5, 10	bitri 278	. 2 ⊢ (∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
12	1, 11	bitri 278	1 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)

This proof depends on syntax axioms:   ↔ wb 209  ∀wal 1567  Ⅎwnf 1812  [wsb 2095   ∈ wcel 2142  Ⅎwnfc 2909

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  ax-6 1996  ax-7 2037  ax-8 2144  ax-10 2175  ax-11 2191  ax-12 2212

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-ex 1809  df-nf 1813  df-sb 2096  df-clel 2837  df-nfc 2911

This theorem is used by: (None)