Theorem nfunidALT 40293

Description: Deduction version of nfuni 4879. (Contributed by NM, 19-Nov-2020.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypothesis

Ref	Expression
nfunidALT.1	⊢ (𝜑 → Ⅎ𝑥𝐴)

Assertion

Ref	Expression
nfunidALT	⊢ (𝜑 → Ⅎ𝑥∪ 𝐴)

Proof of Theorem nfunidALT

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfunidALT.1	. 2 ⊢ (𝜑 → Ⅎ𝑥𝐴)
2		abidnf 3663	. . 3 ⊢ (Ⅎ𝑥𝐴 → {𝑦 ∣ ∀𝑥 𝑦 ∈ 𝐴} = 𝐴)
3	2	unieqd 4885	. 2 ⊢ (Ⅎ𝑥𝐴 → ∪ {𝑦 ∣ ∀𝑥 𝑦 ∈ 𝐴} = ∪ 𝐴)
4		nfaba1 2934	. . 3 ⊢ Ⅎ𝑥{𝑦 ∣ ∀𝑥 𝑦 ∈ 𝐴}
5	4	nfuni 4879	. 2 ⊢ Ⅎ𝑥∪ {𝑦 ∣ ∀𝑥 𝑦 ∈ 𝐴}
6	1, 3, 5	nfded 40290	1 ⊢ (𝜑 → Ⅎ𝑥∪ 𝐴)

This proof depends on syntax axioms:   → wi 4  ∀wal 1568   ∈ wcel 2147  {cab 2741  Ⅎwnfc 2911  ∪ cuni 4872

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-uni 4873

This theorem is used by: (None)