Theorem iunxpssiun1 32984

Description: Provide an upper bound for the indexed union of cartesian products. (Contributed by Thierry Arnoux, 13-Oct-2025.)

Hypothesis

Ref	Expression
iunxpssiun1.1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ⊆ 𝐸)

Assertion

Ref	Expression
iunxpssiun1	⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 (𝐵 × 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 × 𝐸))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐸   𝜑,𝑥

Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)

Proof of Theorem iunxpssiun1

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssiun2 5014	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
2	1	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ ∪ 𝑥 ∈ 𝐴 𝐵)
3		nfcv 2927	. . . . . . 7 ⊢ Ⅎ𝑦𝐵
4		nfcsb1v 3878	. . . . . . 7 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵
5		csbeq1a 3868	. . . . . . 7 ⊢ (𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵)
6	3, 4, 5	cbviun 5001	. . . . . 6 ⊢ ∪ 𝑥 ∈ 𝐴 𝐵 = ∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵
7	2, 6	sseqtrdi 3978	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ⊆ ∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵)
8		iunxpssiun1.1	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ⊆ 𝐸)
9		xpss12 5678	. . . . 5 ⊢ ((𝐵 ⊆ ∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 ∧ 𝐶 ⊆ 𝐸) → (𝐵 × 𝐶) ⊆ (∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 × 𝐸))
10	7, 8, 9	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐵 × 𝐶) ⊆ (∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 × 𝐸))
11	10	ralrimiva 3159	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 (𝐵 × 𝐶) ⊆ (∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 × 𝐸))
12		nfcv 2927	. . . . . 6 ⊢ Ⅎ𝑥𝐴
13	12, 4	nfiun 4990	. . . . 5 ⊢ Ⅎ𝑥∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵
14		nfcv 2927	. . . . 5 ⊢ Ⅎ𝑥𝐸
15	13, 14	nfxp 5696	. . . 4 ⊢ Ⅎ𝑥(∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 × 𝐸)
16	15	iunssf 5009	. . 3 ⊢ (∪ 𝑥 ∈ 𝐴 (𝐵 × 𝐶) ⊆ (∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 × 𝐸) ↔ ∀𝑥 ∈ 𝐴 (𝐵 × 𝐶) ⊆ (∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 × 𝐸))
17	11, 16	sylibr 237	. 2 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 (𝐵 × 𝐶) ⊆ (∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 × 𝐸))
18	6	xpeq1i 5689	. 2 ⊢ (∪ 𝑥 ∈ 𝐴 𝐵 × 𝐸) = (∪ 𝑦 ∈ 𝐴 ⦋𝑦 / 𝑥⦌𝐵 × 𝐸)
19	17, 18	sseqtrrdi 3979	1 ⊢ (𝜑 → ∪ 𝑥 ∈ 𝐴 (𝐵 × 𝐶) ⊆ (∪ 𝑥 ∈ 𝐴 𝐵 × 𝐸))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2146  ∀wral 3081  ⦋csb 3854   ⊆ wss 3906  ∪ ciun 4958   × cxp 5661

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-rex 3092  df-v 3459  df-sbc 3747  df-csb 3855  df-ss 3923  df-iun 4960  df-opab 5176  df-xp 5669

This theorem is used by:  fldextrspunlsplem  34127