Theorem sxval 34934

Description: Value of the product sigma-algebra operation. (Contributed by Thierry Arnoux, 1-Jun-2017.)

Hypothesis

Ref	Expression
sxval.1	⊢ 𝐴 = ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑇 ↦ (𝑥 × 𝑦))

Assertion

Ref	Expression
sxval	⊢ ((𝑆 ∈ 𝑉 ∧ 𝑇 ∈ 𝑊) → (𝑆 ×s 𝑇) = (sigaGen‘𝐴))

Distinct variable groups:   𝑥,𝑦,𝑆   𝑥,𝑇,𝑦

Allowed substitution hints:   𝐴(𝑥, 𝑦)   𝑉(𝑥, 𝑦)   𝑊(𝑥, 𝑦)

Proof of Theorem sxval

Dummy variables 𝑡 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3475	. . 3 ⊢ (𝑆 ∈ 𝑉 → 𝑆 ∈ V)
2		elex 3475	. . 3 ⊢ (𝑇 ∈ 𝑊 → 𝑇 ∈ V)
3		id 23	. . . . . . 7 ⊢ (𝑠 = 𝑆 → 𝑠 = 𝑆)
4		eqidd 2764	. . . . . . 7 ⊢ (𝑠 = 𝑆 → 𝑡 = 𝑡)
5		eqidd 2764	. . . . . . 7 ⊢ (𝑠 = 𝑆 → (𝑥 × 𝑦) = (𝑥 × 𝑦))
6	3, 4, 5	mpoeq123dv 7526	. . . . . 6 ⊢ (𝑠 = 𝑆 → (𝑥 ∈ 𝑠, 𝑦 ∈ 𝑡 ↦ (𝑥 × 𝑦)) = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑡 ↦ (𝑥 × 𝑦)))
7	6	rneqd 5932	. . . . 5 ⊢ (𝑠 = 𝑆 → ran (𝑥 ∈ 𝑠, 𝑦 ∈ 𝑡 ↦ (𝑥 × 𝑦)) = ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑡 ↦ (𝑥 × 𝑦)))
8	7	fveq2d 6920	. . . 4 ⊢ (𝑠 = 𝑆 → (sigaGen‘ran (𝑥 ∈ 𝑠, 𝑦 ∈ 𝑡 ↦ (𝑥 × 𝑦))) = (sigaGen‘ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑡 ↦ (𝑥 × 𝑦))))
9		eqidd 2764	. . . . . . 7 ⊢ (𝑡 = 𝑇 → 𝑆 = 𝑆)
10		id 23	. . . . . . 7 ⊢ (𝑡 = 𝑇 → 𝑡 = 𝑇)
11		eqidd 2764	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (𝑥 × 𝑦) = (𝑥 × 𝑦))
12	9, 10, 11	mpoeq123dv 7526	. . . . . 6 ⊢ (𝑡 = 𝑇 → (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑡 ↦ (𝑥 × 𝑦)) = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑇 ↦ (𝑥 × 𝑦)))
13	12	rneqd 5932	. . . . 5 ⊢ (𝑡 = 𝑇 → ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑡 ↦ (𝑥 × 𝑦)) = ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑇 ↦ (𝑥 × 𝑦)))
14	13	fveq2d 6920	. . . 4 ⊢ (𝑡 = 𝑇 → (sigaGen‘ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑡 ↦ (𝑥 × 𝑦))) = (sigaGen‘ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑇 ↦ (𝑥 × 𝑦))))
15		df-sx 34933	. . . 4 ⊢ ×s = (𝑠 ∈ V, 𝑡 ∈ V ↦ (sigaGen‘ran (𝑥 ∈ 𝑠, 𝑦 ∈ 𝑡 ↦ (𝑥 × 𝑦))))
16		fvex 6929	. . . 4 ⊢ (sigaGen‘ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑇 ↦ (𝑥 × 𝑦))) ∈ V
17	8, 14, 15, 16	ovmpo 7612	. . 3 ⊢ ((𝑆 ∈ V ∧ 𝑇 ∈ V) → (𝑆 ×s 𝑇) = (sigaGen‘ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑇 ↦ (𝑥 × 𝑦))))
18	1, 2, 17	syl2an 608	. 2 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑇 ∈ 𝑊) → (𝑆 ×s 𝑇) = (sigaGen‘ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑇 ↦ (𝑥 × 𝑦))))
19		sxval.1	. . 3 ⊢ 𝐴 = ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑇 ↦ (𝑥 × 𝑦))
20	19	fveq2i 6919	. 2 ⊢ (sigaGen‘𝐴) = (sigaGen‘ran (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑇 ↦ (𝑥 × 𝑦)))
21	18, 20	eqtr4di 2816	1 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑇 ∈ 𝑊) → (𝑆 ×s 𝑇) = (sigaGen‘𝐴))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   × cxp 5656  ran crn 5659  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  sigaGencsigagen 34882   ×_s csx 34932

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-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  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-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-sx 34933

This theorem is used by:  sxsiga  34935  sxsigon  34936  elsx  34938  mbfmco2  35008  sxbrsigalem5  35031  sxbrsiga  35033