Theorem nfcoll 44853

Description: Bound-variable hypothesis builder for the collection operation. (Contributed by Rohan Ridenour, 11-Aug-2023.)

Hypotheses

Ref	Expression
nfcoll.1	⊢ Ⅎ𝑥𝐹
nfcoll.2	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
nfcoll	⊢ Ⅎ𝑥(𝐹 Coll 𝐴)

Proof of Theorem nfcoll

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-coll 44848	. 2 ⊢ (𝐹 Coll 𝐴) = ∪ 𝑦 ∈ 𝐴 Scott (𝐹 “ {𝑦})
2		nfcoll.2	. . 3 ⊢ Ⅎ𝑥𝐴
3		nfcoll.1	. . . . 5 ⊢ Ⅎ𝑥𝐹
4		nfcv 2931	. . . . 5 ⊢ Ⅎ𝑥{𝑦}
5	3, 4	nfima 6068	. . . 4 ⊢ Ⅎ𝑥(𝐹 “ {𝑦})
6	5	nfscott 9861	. . 3 ⊢ Ⅎ𝑥Scott (𝐹 “ {𝑦})
7	2, 6	nfiun 4989	. 2 ⊢ Ⅎ𝑥∪ 𝑦 ∈ 𝐴 Scott (𝐹 “ {𝑦})
8	1, 7	nfcxfr 2929	1 ⊢ Ⅎ𝑥(𝐹 Coll 𝐴)

Syntax hints:  Ⅎwnfc 2916  {csn 4591  ∪ ciun 4957   “ cima 5662  Scott cscott 9853   Coll ccoll 44847

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-iun 4959  df-br 5111  df-opab 5175  df-xp 5665  df-cnv 5667  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-scott 9854  df-coll 44848

This theorem is referenced by: (None)