suppovss - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > suppovss		Structured version Visualization version GIF version

Theorem suppovss 32611

Description: A bound for the support of an operation. (Contributed by Thierry Arnoux, 19-Jul-2023.)

**Hypotheses**
Ref	Expression
suppovss.f	⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
suppovss.g	⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝑦 ∈ 𝐵 ↦ 𝐶))
suppovss.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
suppovss.b	⊢ (𝜑 → 𝐵 ∈ 𝑊)
suppovss.z	⊢ (𝜑 → 𝑍 ∈ 𝐷)
suppovss.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝐶 ∈ 𝐷)

**Assertion**
Ref	Expression
suppovss	⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ ((𝐺 supp (𝐵 × {𝑍})) × ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))

Distinct variable groups: 𝐴,𝑘,𝑥,𝑦 𝐵,𝑘,𝑥,𝑦 𝑥,𝐷,𝑦 𝑥,𝐹,𝑦 𝑘,𝐺,𝑥,𝑦 𝑘,𝑍,𝑥,𝑦 𝜑,𝑘,𝑥,𝑦 Allowed substitution hints: 𝐶(𝑥,𝑦,𝑘) 𝐷(𝑘) 𝐹(𝑘) 𝑉(𝑥,𝑦,𝑘) 𝑊(𝑥,𝑦,𝑘)

Proof of Theorem suppovss Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		suppovss.1	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → 𝐶 ∈ 𝐷)
2	1	ralrimivva 3181	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷)
3		suppovss.f	. . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶)
4	3	fmpo 8050	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝐶 ∈ 𝐷 ↔ 𝐹:(𝐴 × 𝐵)⟶𝐷)
5	2, 4	sylib 218	. 2 ⊢ (𝜑 → 𝐹:(𝐴 × 𝐵)⟶𝐷)
6		simpr 484	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝑧 = ⟨𝑥, 𝑦⟩)
7	6	fveq2d 6865	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝐹‘𝑧) = (𝐹‘⟨𝑥, 𝑦⟩))
8		df-ov 7393	. . . . . . . 8 ⊢ (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
9		simpllr 775	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))))
10	9	eldifad 3929	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝑥 ∈ 𝐴)
11		simplr 768	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝑦 ∈ 𝐵)
12		simplll 774	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝜑)
13	12, 10, 11, 1	syl12anc 836	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝐶 ∈ 𝐷)
14	3	ovmpt4g 7539	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵 ∧ 𝐶 ∈ 𝐷) → (𝑥𝐹𝑦) = 𝐶)
15	10, 11, 13, 14	syl3anc 1373	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝑥𝐹𝑦) = 𝐶)
16	8, 15	eqtr3id 2779	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝐹‘⟨𝑥, 𝑦⟩) = 𝐶)
17		suppovss.b	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
18	17	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 ∈ 𝑊)
19	18	mptexd 7201	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V)
20		suppovss.g	. . . . . . . . . . . 12 ⊢ 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝑦 ∈ 𝐵 ↦ 𝐶))
21	19, 20	fmptd 7089	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺:𝐴⟶V)
22		ssidd 3973	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐺 supp (𝐵 × {𝑍})) ⊆ (𝐺 supp (𝐵 × {𝑍})))
23		suppovss.a	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
24		snex 5394	. . . . . . . . . . . . 13 ⊢ {𝑍} ∈ V
25	24	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → {𝑍} ∈ V)
26	17, 25	xpexd 7730	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐵 × {𝑍}) ∈ V)
27	21, 22, 23, 26	suppssr 8177	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) → (𝐺‘𝑥) = (𝐵 × {𝑍}))
28	27	fveq1d 6863	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) → ((𝐺‘𝑥)‘𝑦) = ((𝐵 × {𝑍})‘𝑦))
29	12, 9, 28	syl2anc 584	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → ((𝐺‘𝑥)‘𝑦) = ((𝐵 × {𝑍})‘𝑦))
30		simpr 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
31	20	fvmpt2 6982	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ↦ 𝐶) ∈ V) → (𝐺‘𝑥) = (𝑦 ∈ 𝐵 ↦ 𝐶))
32	30, 19, 31	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) = (𝑦 ∈ 𝐵 ↦ 𝐶))
33	1	anassrs 467	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ 𝐷)
34	32, 33	fvmpt2d 6984	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → ((𝐺‘𝑥)‘𝑦) = 𝐶)
35	12, 10, 11, 34	syl21anc 837	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → ((𝐺‘𝑥)‘𝑦) = 𝐶)
36		suppovss.z	. . . . . . . . . 10 ⊢ (𝜑 → 𝑍 ∈ 𝐷)
37	12, 36	syl 17	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝑍 ∈ 𝐷)
38		fvconst2g 7179	. . . . . . . . 9 ⊢ ((𝑍 ∈ 𝐷 ∧ 𝑦 ∈ 𝐵) → ((𝐵 × {𝑍})‘𝑦) = 𝑍)
39	37, 11, 38	syl2anc 584	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → ((𝐵 × {𝑍})‘𝑦) = 𝑍)
40	29, 35, 39	3eqtr3d 2773	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝐶 = 𝑍)
41	7, 16, 40	3eqtrd 2769	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝐹‘𝑧) = 𝑍)
42	41	adantl3r 750	. . . . 5 ⊢ (((((𝜑 ∧ 𝑧 ∈ ((𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))) × 𝐵)) ∧ 𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝐹‘𝑧) = 𝑍)
43		elxp2 5665	. . . . . . 7 ⊢ (𝑧 ∈ ((𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))) × 𝐵) ↔ ∃𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩)
44	43	biimpi 216	. . . . . 6 ⊢ (𝑧 ∈ ((𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))) × 𝐵) → ∃𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩)
45	44	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ((𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))) × 𝐵)) → ∃𝑥 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩)
46	42, 45	r19.29vva 3198	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ((𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))) × 𝐵)) → (𝐹‘𝑧) = 𝑍)
47	46	adantlr 715	. . 3 ⊢ (((𝜑 ∧ 𝑧 ∈ ((𝐴 × 𝐵) ∖ ((𝐺 supp (𝐵 × {𝑍})) × ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))) ∧ 𝑧 ∈ ((𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))) × 𝐵)) → (𝐹‘𝑧) = 𝑍)
48		simpr 484	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝑧 = ⟨𝑥, 𝑦⟩)
49	48	fveq2d 6865	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝐹‘𝑧) = (𝐹‘⟨𝑥, 𝑦⟩))
50		simpllr 775	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝑥 ∈ 𝐴)
51		simplr 768	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))
52	51	eldifad 3929	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝑦 ∈ 𝐵)
53		simplll 774	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝜑)
54	53, 50, 52, 1	syl12anc 836	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝐶 ∈ 𝐷)
55	50, 52, 54, 14	syl3anc 1373	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝑥𝐹𝑦) = 𝐶)
56	8, 55	eqtr3id 2779	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝐹‘⟨𝑥, 𝑦⟩) = 𝐶)
57	53, 50, 52, 34	syl21anc 837	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → ((𝐺‘𝑥)‘𝑦) = 𝐶)
58		fvexd 6876	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → ((𝐺‘𝑥)‘𝑦) ∈ V)
59	33, 32, 58	fmpt2d 7099	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥):𝐵⟶V)
60		ssiun2 5014	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐴 → ((𝐺‘𝑥) supp 𝑍) ⊆ ∪ 𝑥 ∈ 𝐴 ((𝐺‘𝑥) supp 𝑍))
61	60	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐺‘𝑥) supp 𝑍) ⊆ ∪ 𝑥 ∈ 𝐴 ((𝐺‘𝑥) supp 𝑍))
62		fveq2 6861	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑘 → (𝐺‘𝑥) = (𝐺‘𝑘))
63	62	oveq1d 7405	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑘 → ((𝐺‘𝑥) supp 𝑍) = ((𝐺‘𝑘) supp 𝑍))
64	63	cbviunv 5007	. . . . . . . . . . . 12 ⊢ ∪ 𝑥 ∈ 𝐴 ((𝐺‘𝑥) supp 𝑍) = ∪ 𝑘 ∈ 𝐴 ((𝐺‘𝑘) supp 𝑍)
65	61, 64	sseqtrdi 3990	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐺‘𝑥) supp 𝑍) ⊆ ∪ 𝑘 ∈ 𝐴 ((𝐺‘𝑘) supp 𝑍))
66		simpl 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) → 𝜑)
67		simpr 484	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) → 𝑘 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))))
68	67	eldifad 3929	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) → 𝑘 ∈ 𝐴)
69	21, 22, 23, 26	suppssr 8177	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) → (𝐺‘𝑘) = (𝐵 × {𝑍}))
70		eleq1w 2812	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 = 𝑘 → (𝑥 ∈ 𝐴 ↔ 𝑘 ∈ 𝐴))
71	70	anbi2d 630	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑘 → ((𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑘 ∈ 𝐴)))
72	62	fneq1d 6614	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑘 → ((𝐺‘𝑥) Fn 𝐵 ↔ (𝐺‘𝑘) Fn 𝐵))
73	71, 72	imbi12d 344	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑥 = 𝑘 → (((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) Fn 𝐵) ↔ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐺‘𝑘) Fn 𝐵)))
74	59	ffnd 6692	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐺‘𝑥) Fn 𝐵)
75	73, 74	chvarvv 1989	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (𝐺‘𝑘) Fn 𝐵)
76	17	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐵 ∈ 𝑊)
77	36	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑍 ∈ 𝐷)
78		fnsuppeq0 8174	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐺‘𝑘) Fn 𝐵 ∧ 𝐵 ∈ 𝑊 ∧ 𝑍 ∈ 𝐷) → (((𝐺‘𝑘) supp 𝑍) = ∅ ↔ (𝐺‘𝑘) = (𝐵 × {𝑍})))
79	75, 76, 77, 78	syl3anc 1373	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → (((𝐺‘𝑘) supp 𝑍) = ∅ ↔ (𝐺‘𝑘) = (𝐵 × {𝑍})))
80	79	biimpar 477	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ 𝐴) ∧ (𝐺‘𝑘) = (𝐵 × {𝑍})) → ((𝐺‘𝑘) supp 𝑍) = ∅)
81	66, 68, 69, 80	syl21anc 837	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) → ((𝐺‘𝑘) supp 𝑍) = ∅)
82	81	ralrimiva 3126	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑘 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))((𝐺‘𝑘) supp 𝑍) = ∅)
83		nfcv 2892	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘(𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))
84	83	iunxdif3 5062	. . . . . . . . . . . . . 14 ⊢ (∀𝑘 ∈ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))((𝐺‘𝑘) supp 𝑍) = ∅ → ∪ 𝑘 ∈ (𝐴 ∖ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))))((𝐺‘𝑘) supp 𝑍) = ∪ 𝑘 ∈ 𝐴 ((𝐺‘𝑘) supp 𝑍))
85	82, 84	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∪ 𝑘 ∈ (𝐴 ∖ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))))((𝐺‘𝑘) supp 𝑍) = ∪ 𝑘 ∈ 𝐴 ((𝐺‘𝑘) supp 𝑍))
86		dfin4 4244	. . . . . . . . . . . . . . 15 ⊢ (𝐴 ∩ (𝐺 supp (𝐵 × {𝑍}))) = (𝐴 ∖ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))))
87		suppssdm 8159	. . . . . . . . . . . . . . . . 17 ⊢ (𝐺 supp (𝐵 × {𝑍})) ⊆ dom 𝐺
88	87, 21	fssdm 6710	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐺 supp (𝐵 × {𝑍})) ⊆ 𝐴)
89		sseqin2 4189	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 supp (𝐵 × {𝑍})) ⊆ 𝐴 ↔ (𝐴 ∩ (𝐺 supp (𝐵 × {𝑍}))) = (𝐺 supp (𝐵 × {𝑍})))
90	88, 89	sylib 218	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝐴 ∩ (𝐺 supp (𝐵 × {𝑍}))) = (𝐺 supp (𝐵 × {𝑍})))
91	86, 90	eqtr3id 2779	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝐴 ∖ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍})))) = (𝐺 supp (𝐵 × {𝑍})))
92	91	iuneq1d 4986	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∪ 𝑘 ∈ (𝐴 ∖ (𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))))((𝐺‘𝑘) supp 𝑍) = ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))
93	85, 92	eqtr3d 2767	. . . . . . . . . . . 12 ⊢ (𝜑 → ∪ 𝑘 ∈ 𝐴 ((𝐺‘𝑘) supp 𝑍) = ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))
94	93	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∪ 𝑘 ∈ 𝐴 ((𝐺‘𝑘) supp 𝑍) = ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))
95	65, 94	sseqtrd 3986	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐺‘𝑥) supp 𝑍) ⊆ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))
96	36	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑍 ∈ 𝐷)
97	59, 95, 18, 96	suppssr 8177	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) → ((𝐺‘𝑥)‘𝑦) = 𝑍)
98	97	adantr 480	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → ((𝐺‘𝑥)‘𝑦) = 𝑍)
99	57, 98	eqtr3d 2767	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → 𝐶 = 𝑍)
100	49, 56, 99	3eqtrd 2769	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝐹‘𝑧) = 𝑍)
101	100	adantl3r 750	. . . . 5 ⊢ (((((𝜑 ∧ 𝑧 ∈ (𝐴 × (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ∧ 𝑧 = ⟨𝑥, 𝑦⟩) → (𝐹‘𝑧) = 𝑍)
102		elxp2 5665	. . . . . . 7 ⊢ (𝑧 ∈ (𝐴 × (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))𝑧 = ⟨𝑥, 𝑦⟩)
103	102	biimpi 216	. . . . . 6 ⊢ (𝑧 ∈ (𝐴 × (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))𝑧 = ⟨𝑥, 𝑦⟩)
104	103	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝐴 × (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))𝑧 = ⟨𝑥, 𝑦⟩)
105	101, 104	r19.29vva 3198	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ (𝐴 × (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))) → (𝐹‘𝑧) = 𝑍)
106	105	adantlr 715	. . 3 ⊢ (((𝜑 ∧ 𝑧 ∈ ((𝐴 × 𝐵) ∖ ((𝐺 supp (𝐵 × {𝑍})) × ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))) ∧ 𝑧 ∈ (𝐴 × (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))) → (𝐹‘𝑧) = 𝑍)
107		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑧 ∈ ((𝐴 × 𝐵) ∖ ((𝐺 supp (𝐵 × {𝑍})) × ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))) → 𝑧 ∈ ((𝐴 × 𝐵) ∖ ((𝐺 supp (𝐵 × {𝑍})) × ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))))
108		difxp 6140	. . . . 5 ⊢ ((𝐴 × 𝐵) ∖ ((𝐺 supp (𝐵 × {𝑍})) × ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))) = (((𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))) × 𝐵) ∪ (𝐴 × (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍))))
109	107, 108	eleqtrdi 2839	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ ((𝐴 × 𝐵) ∖ ((𝐺 supp (𝐵 × {𝑍})) × ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))) → 𝑧 ∈ (((𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))) × 𝐵) ∪ (𝐴 × (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))))
110		elun 4119	. . . 4 ⊢ (𝑧 ∈ (((𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))) × 𝐵) ∪ (𝐴 × (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))) ↔ (𝑧 ∈ ((𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))) × 𝐵) ∨ 𝑧 ∈ (𝐴 × (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))))
111	109, 110	sylib 218	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ ((𝐴 × 𝐵) ∖ ((𝐺 supp (𝐵 × {𝑍})) × ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))) → (𝑧 ∈ ((𝐴 ∖ (𝐺 supp (𝐵 × {𝑍}))) × 𝐵) ∨ 𝑧 ∈ (𝐴 × (𝐵 ∖ ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))))
112	47, 106, 111	mpjaodan 960	. 2 ⊢ ((𝜑 ∧ 𝑧 ∈ ((𝐴 × 𝐵) ∖ ((𝐺 supp (𝐵 × {𝑍})) × ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))) → (𝐹‘𝑧) = 𝑍)
113	5, 112	suppss 8176	1 ⊢ (𝜑 → (𝐹 supp 𝑍) ⊆ ((𝐺 supp (𝐵 × {𝑍})) × ∪ 𝑘 ∈ (𝐺 supp (𝐵 × {𝑍}))((𝐺‘𝑘) supp 𝑍)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ∀wral 3045 ∃wrex 3054 Vcvv 3450 ∖ cdif 3914 ∪ cun 3915 ∩ cin 3916 ⊆ wss 3917 ∅c0 4299 {csn 4592 ⟨cop 4598 ∪ ciun 4958 ↦ cmpt 5191 × cxp 5639 Fn wfn 6509 ⟶wf 6510 ‘cfv 6514 (class class class)co 7390 ∈ cmpo 7392 supp csupp 8142

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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714

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-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-ov 7393 df-oprab 7394 df-mpo 7395 df-1st 7971 df-2nd 7972 df-supp 8143

This theorem is referenced by: fedgmullem1 33632

W3C validator