Theorem prodeq1iOLD 15931

Description: Obsolete version of prodeq1i 15930 as of 1-Sep-2025. (Contributed by Scott Fenton, 4-Dec-2017.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypothesis

Ref	Expression
prodeq1iOLD.1	⊢ 𝐴 = 𝐵

Assertion

Ref	Expression
prodeq1iOLD	⊢ ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶

Distinct variable groups:   𝐴,𝑘   𝐵,𝑘

Allowed substitution hint:   𝐶(𝑘)

Proof of Theorem prodeq1iOLD

Step	Hyp	Ref	Expression
1		prodeq1iOLD.1	. 2 ⊢ 𝐴 = 𝐵
2		prodeq1 15921	. 2 ⊢ (𝐴 = 𝐵 → ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶)
3	1, 2	ax-mp 5	1 ⊢ ∏𝑘 ∈ 𝐴 𝐶 = ∏𝑘 ∈ 𝐵 𝐶

Syntax hints:   = wceq 1540  ∏cprod 15917

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2065  df-clab 2714  df-cleq 2727  df-clel 2809  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-mpt 5202  df-xp 5660  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-pred 6290  df-iota 6483  df-f 6534  df-f1 6535  df-fo 6536  df-f1o 6537  df-fv 6538  df-ov 7406  df-oprab 7407  df-mpo 7408  df-frecs 8278  df-wrecs 8309  df-recs 8383  df-rdg 8422  df-seq 14018  df-prod 15918

This theorem is referenced by: (None)