Theorem nfcoll 44701

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 44696	. 2 ⊢ (𝐹 Coll 𝐴) = ∪ 𝑦 ∈ 𝐴 Scott (𝐹 “ {𝑦})
2		nfcoll.2	. . 3 ⊢ Ⅎ𝑥𝐴
3		nfcoll.1	. . . . 5 ⊢ Ⅎ𝑥𝐹
4		nfcv 2899	. . . . 5 ⊢ Ⅎ𝑥{𝑦}
5	3, 4	nfima 6027	. . . 4 ⊢ Ⅎ𝑥(𝐹 “ {𝑦})
6	5	nfscott 44684	. . 3 ⊢ Ⅎ𝑥Scott (𝐹 “ {𝑦})
7	2, 6	nfiun 4966	. 2 ⊢ Ⅎ𝑥∪ 𝑦 ∈ 𝐴 Scott (𝐹 “ {𝑦})
8	1, 7	nfcxfr 2897	1 ⊢ Ⅎ𝑥(𝐹 Coll 𝐴)

Syntax hints:  Ⅎwnfc 2884  {csn 4568  ∪ ciun 4934   “ cima 5627  Scott cscott 44680   Coll ccoll 44695

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-iun 4936  df-br 5087  df-opab 5149  df-xp 5630  df-cnv 5632  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-scott 44681  df-coll 44696

This theorem is referenced by: (None)