Theorem nfunidALT 40167

Description: Deduction version of nfuni 4876. (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 3662	. . 3 ⊢ (Ⅎ𝑥𝐴 → {𝑦 ∣ ∀𝑥 𝑦 ∈ 𝐴} = 𝐴)
3	2	unieqd 4882	. 2 ⊢ (Ⅎ𝑥𝐴 → ∪ {𝑦 ∣ ∀𝑥 𝑦 ∈ 𝐴} = ∪ 𝐴)
4		nfaba1 2933	. . 3 ⊢ Ⅎ𝑥{𝑦 ∣ ∀𝑥 𝑦 ∈ 𝐴}
5	4	nfuni 4876	. 2 ⊢ Ⅎ𝑥∪ {𝑦 ∣ ∀𝑥 𝑦 ∈ 𝐴}
6	1, 3, 5	nfded 40164	1 ⊢ (𝜑 → Ⅎ𝑥∪ 𝐴)

This proof depends on syntax axioms:   → wi 4  ∀wal 1567   ∈ wcel 2146  {cab 2741  Ⅎwnfc 2910  ∪ cuni 4869

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090  df-v 3455  df-ss 3900  df-uni 4870

This theorem is used by: (None)