Theorem bj-nfcf 33497

Description: Version of df-nfc 2921 with a disjoint variable condition replaced with a non-freeness 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 2921	. 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴)
2		bj-nfcf.nf	. . . . . 6 ⊢ Ⅎ𝑦𝐴
3	2	nfcri 2929	. . . . 5 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐴
4	3	nfnf 2302	. . . 4 ⊢ Ⅎ𝑦Ⅎ𝑥 𝑧 ∈ 𝐴
5	4	sb8 2501	. . 3 ⊢ (∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ ∀𝑦[𝑦 / 𝑧]Ⅎ𝑥 𝑧 ∈ 𝐴)
6		bj-sbnf 33407	. . . . 5 ⊢ ([𝑦 / 𝑧]Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ Ⅎ𝑥[𝑦 / 𝑧]𝑧 ∈ 𝐴)
7		clelsb3 2888	. . . . . 6 ⊢ ([𝑦 / 𝑧]𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)
8	7	nfbii 1896	. . . . 5 ⊢ (Ⅎ𝑥[𝑦 / 𝑧]𝑧 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐴)
9	6, 8	bitri 267	. . . 4 ⊢ ([𝑦 / 𝑧]Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐴)
10	9	albii 1863	. . 3 ⊢ (∀𝑦[𝑦 / 𝑧]Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
11	5, 10	bitri 267	. 2 ⊢ (∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)
12	1, 11	bitri 267	1 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑦Ⅎ𝑥 𝑦 ∈ 𝐴)

Syntax hints:   ↔ wb 198  ∀wal 1599  Ⅎwnf 1827  [wsb 2011   ∈ wcel 2107  Ⅎwnfc 2919

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334

This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-clel 2774  df-nfc 2921

This theorem is referenced by: (None)