Theorem colleq12d 45498

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 6069	. . . 4 ⊢ (𝜑 → (𝐹 “ {𝑥}) = (𝐺 “ {𝑥}))
4	3	scotteqd 9967	. . 3 ⊢ (𝜑 → Scott (𝐹 “ {𝑥}) = Scott (𝐺 “ {𝑥}))
5	1, 4	iuneq12d 4985	. 2 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 Scott (𝐹 “ {𝑥}) = ∪ 𝑥 ∈ 𝐵 Scott (𝐺 “ {𝑥}))
6		df-coll 45496	. 2 ⊢ (𝐹 Coll 𝐴) = ∪ 𝑥 ∈ 𝐴 Scott (𝐹 “ {𝑥})
7		df-coll 45496	. 2 ⊢ (𝐺 Coll 𝐵) = ∪ 𝑥 ∈ 𝐵 Scott (𝐺 “ {𝑥})
8	5, 6, 7	3eqtr4g 2823	1 ⊢ (𝜑 → (𝐹 Coll 𝐴) = (𝐺 Coll 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570  {csn 4588  ∪ ciun 4956   “ cima 5661  Scott cscott 9965   Coll ccoll 45495

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-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-iun 4958  df-br 5109  df-opab 5174  df-cnv 5666  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-scott 9966  df-coll 45496

This theorem is used by:  colleq1  45499  colleq2  45500