Theorem colleq12d 45331

Description: Equality theorem for the collection operation. (Contributed by Rohan Ridenour, 11-Aug-2023.)

Hypotheses

Ref	Expression
colleq12d.1	⊢ (𝜑 → 𝐹 = 𝐺)
colleq12d.2	⊢ (𝜑 → 𝐴 = 𝐵)

Assertion

Ref	Expression
colleq12d	⊢ (𝜑 → (𝐹 Coll 𝐴) = (𝐺 Coll 𝐵))

Proof of Theorem colleq12d

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		colleq12d.2	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
2		colleq12d.1	. . . . 5 ⊢ (𝜑 → 𝐹 = 𝐺)
3	2	imaeq1d 6050	. . . 4 ⊢ (𝜑 → (𝐹 “ {𝑥}) = (𝐺 “ {𝑥}))
4	3	scotteqd 9934	. . 3 ⊢ (𝜑 → Scott (𝐹 “ {𝑥}) = Scott (𝐺 “ {𝑥}))
5	1, 4	iuneq12d 4979	. 2 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 Scott (𝐹 “ {𝑥}) = ∪ 𝑥 ∈ 𝐵 Scott (𝐺 “ {𝑥}))
6		df-coll 45329	. 2 ⊢ (𝐹 Coll 𝐴) = ∪ 𝑥 ∈ 𝐴 Scott (𝐹 “ {𝑥})
7		df-coll 45329	. 2 ⊢ (𝐺 Coll 𝐵) = ∪ 𝑥 ∈ 𝐵 Scott (𝐺 “ {𝑥})
8	5, 6, 7	3eqtr4g 2820	1 ⊢ (𝜑 → (𝐹 Coll 𝐴) = (𝐺 Coll 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1569  {csn 4584  ∪ ciun 4950   “ cima 5653  Scott cscott 9932   Coll ccoll 45328

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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-iun 4952  df-br 5103  df-opab 5167  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-scott 9933  df-coll 45329

This theorem is used by:  colleq1  45332  colleq2  45333