Theorem nfcr 2887

Description: Consequence of the not-free predicate. (Contributed by Mario Carneiro, 11-Aug-2016.) Drop ax-12 2170 but use ax-8 2107, df-clel 2809, and avoid a DV condition on 𝑦, 𝐴. (Revised by SN, 3-Jun-2024.)

Assertion

Ref	Expression
nfcr	⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴)

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝐴(𝑥,𝑦)

Proof of Theorem nfcr

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-nfc 2884	. 2 ⊢ (Ⅎ𝑥𝐴 ↔ ∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴)
2		eleq1w 2815	. . . 4 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴))
3	2	nfbidv 1924	. . 3 ⊢ (𝑧 = 𝑦 → (Ⅎ𝑥 𝑧 ∈ 𝐴 ↔ Ⅎ𝑥 𝑦 ∈ 𝐴))
4	3	spvv 1999	. 2 ⊢ (∀𝑧Ⅎ𝑥 𝑧 ∈ 𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴)
5	1, 4	sylbi 216	1 ⊢ (Ⅎ𝑥𝐴 → Ⅎ𝑥 𝑦 ∈ 𝐴)

Syntax hints:   → wi 4  ∀wal 1538  Ⅎwnf 1784   ∈ wcel 2105  Ⅎwnfc 2882

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107

This theorem depends on definitions:  df-bi 206  df-an 396  df-ex 1781  df-nf 1785  df-clel 2809  df-nfc 2884

This theorem is referenced by:  nfcri  2889  nfcrd  2891  abidnf  3698  csbtt  3910  csbnestgfw  4419  csbnestgf  4424