fsuppunbi - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > fsuppunbi		Structured version Visualization version GIF version

Theorem fsuppunbi 9335

Description: If the union of two classes/functions is a function, this union is finitely supported iff the two functions are finitely supported. (Contributed by AV, 18-Jun-2019.)

**Hypothesis**
Ref	Expression
fsuppunbi.u	⊢ (𝜑 → Fun (𝐹 ∪ 𝐺))

**Assertion**
Ref	Expression
fsuppunbi	⊢ (𝜑 → ((𝐹 ∪ 𝐺) finSupp 𝑍 ↔ (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍)))

**Proof of Theorem fsuppunbi**
Step	Hyp	Ref	Expression
1		relfsupp 9309	. . . . 5 ⊢ Rel finSupp
2	1	brrelex12i 5702	. . . 4 ⊢ ((𝐹 ∪ 𝐺) finSupp 𝑍 → ((𝐹 ∪ 𝐺) ∈ V ∧ 𝑍 ∈ V))
3		unexb 7730	. . . . 5 ⊢ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ↔ (𝐹 ∪ 𝐺) ∈ V)
4		simpr 488	. . . . . . . . . . . 12 ⊢ ((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) → ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin)
5	4	adantr 484	. . . . . . . . . . 11 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin)
6		simprlr 789	. . . . . . . . . . . 12 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → 𝐺 ∈ V)
7	6	suppun 8164	. . . . . . . . . . 11 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → (𝐹 supp 𝑍) ⊆ ((𝐹 ∪ 𝐺) supp 𝑍))
8	5, 7	ssfid 9213	. . . . . . . . . 10 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → (𝐹 supp 𝑍) ∈ Fin)
9		fununfun 6569	. . . . . . . . . . . . . 14 ⊢ (Fun (𝐹 ∪ 𝐺) → (Fun 𝐹 ∧ Fun 𝐺))
10	9	simpld 498	. . . . . . . . . . . . 13 ⊢ (Fun (𝐹 ∪ 𝐺) → Fun 𝐹)
11	10	adantr 484	. . . . . . . . . . . 12 ⊢ ((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) → Fun 𝐹)
12	11	adantr 484	. . . . . . . . . . 11 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → Fun 𝐹)
13		simprll 788	. . . . . . . . . . 11 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → 𝐹 ∈ V)
14		simpr 488	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V) → 𝑍 ∈ V)
15	14	adantl 485	. . . . . . . . . . 11 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → 𝑍 ∈ V)
16		funisfsupp 9313	. . . . . . . . . . 11 ⊢ ((Fun 𝐹 ∧ 𝐹 ∈ V ∧ 𝑍 ∈ V) → (𝐹 finSupp 𝑍 ↔ (𝐹 supp 𝑍) ∈ Fin))
17	12, 13, 15, 16	syl3anc 1390	. . . . . . . . . 10 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → (𝐹 finSupp 𝑍 ↔ (𝐹 supp 𝑍) ∈ Fin))
18	8, 17	mpbird 259	. . . . . . . . 9 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → 𝐹 finSupp 𝑍)
19		uncom 4111	. . . . . . . . . . . . . . 15 ⊢ (𝐹 ∪ 𝐺) = (𝐺 ∪ 𝐹)
20	19	oveq1i 7406	. . . . . . . . . . . . . 14 ⊢ ((𝐹 ∪ 𝐺) supp 𝑍) = ((𝐺 ∪ 𝐹) supp 𝑍)
21	20	eleq1i 2853	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin ↔ ((𝐺 ∪ 𝐹) supp 𝑍) ∈ Fin)
22	21	bilani 508	. . . . . . . . . . . 12 ⊢ ((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) → ((𝐺 ∪ 𝐹) supp 𝑍) ∈ Fin)
23	22	adantr 484	. . . . . . . . . . 11 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → ((𝐺 ∪ 𝐹) supp 𝑍) ∈ Fin)
24	13	suppun 8164	. . . . . . . . . . 11 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → (𝐺 supp 𝑍) ⊆ ((𝐺 ∪ 𝐹) supp 𝑍))
25	23, 24	ssfid 9213	. . . . . . . . . 10 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → (𝐺 supp 𝑍) ∈ Fin)
26	9	simprd 499	. . . . . . . . . . . . 13 ⊢ (Fun (𝐹 ∪ 𝐺) → Fun 𝐺)
27	26	adantr 484	. . . . . . . . . . . 12 ⊢ ((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) → Fun 𝐺)
28	27	adantr 484	. . . . . . . . . . 11 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → Fun 𝐺)
29		funisfsupp 9313	. . . . . . . . . . 11 ⊢ ((Fun 𝐺 ∧ 𝐺 ∈ V ∧ 𝑍 ∈ V) → (𝐺 finSupp 𝑍 ↔ (𝐺 supp 𝑍) ∈ Fin))
30	28, 6, 15, 29	syl3anc 1390	. . . . . . . . . 10 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → (𝐺 finSupp 𝑍 ↔ (𝐺 supp 𝑍) ∈ Fin))
31	25, 30	mpbird 259	. . . . . . . . 9 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → 𝐺 finSupp 𝑍)
32	18, 31	jca 519	. . . . . . . 8 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍))
33	32	a1d 25	. . . . . . 7 ⊢ (((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) ∧ ((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V)) → (𝜑 → (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍)))
34	33	ex 416	. . . . . 6 ⊢ ((Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin) → (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V) → (𝜑 → (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍))))
35		fsuppimp 9314	. . . . . 6 ⊢ ((𝐹 ∪ 𝐺) finSupp 𝑍 → (Fun (𝐹 ∪ 𝐺) ∧ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin))
36	34, 35	syl11 33	. . . . 5 ⊢ (((𝐹 ∈ V ∧ 𝐺 ∈ V) ∧ 𝑍 ∈ V) → ((𝐹 ∪ 𝐺) finSupp 𝑍 → (𝜑 → (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍))))
37	3, 36	sylanbr 591	. . . 4 ⊢ (((𝐹 ∪ 𝐺) ∈ V ∧ 𝑍 ∈ V) → ((𝐹 ∪ 𝐺) finSupp 𝑍 → (𝜑 → (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍))))
38	2, 37	mpcom 38	. . 3 ⊢ ((𝐹 ∪ 𝐺) finSupp 𝑍 → (𝜑 → (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍)))
39	38	com12 32	. 2 ⊢ (𝜑 → ((𝐹 ∪ 𝐺) finSupp 𝑍 → (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍)))
40		simpl 486	. . . . . 6 ⊢ ((𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍) → 𝐹 finSupp 𝑍)
41		simpr 488	. . . . . 6 ⊢ ((𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍) → 𝐺 finSupp 𝑍)
42	40, 41	fsuppun 9333	. . . . 5 ⊢ ((𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍) → ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin)
43	42	adantl 485	. . . 4 ⊢ ((𝜑 ∧ (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍)) → ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin)
44		fsuppunbi.u	. . . . . 6 ⊢ (𝜑 → Fun (𝐹 ∪ 𝐺))
45	44	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍)) → Fun (𝐹 ∪ 𝐺))
46	1	brrelex1i 5703	. . . . . . 7 ⊢ (𝐹 finSupp 𝑍 → 𝐹 ∈ V)
47	1	brrelex1i 5703	. . . . . . 7 ⊢ (𝐺 finSupp 𝑍 → 𝐺 ∈ V)
48		unexg 7726	. . . . . . 7 ⊢ ((𝐹 ∈ V ∧ 𝐺 ∈ V) → (𝐹 ∪ 𝐺) ∈ V)
49	46, 47, 48	syl2an 605	. . . . . 6 ⊢ ((𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍) → (𝐹 ∪ 𝐺) ∈ V)
50	49	adantl 485	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍)) → (𝐹 ∪ 𝐺) ∈ V)
51	1	brrelex2i 5704	. . . . . . 7 ⊢ (𝐹 finSupp 𝑍 → 𝑍 ∈ V)
52	51	adantr 484	. . . . . 6 ⊢ ((𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍) → 𝑍 ∈ V)
53	52	adantl 485	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍)) → 𝑍 ∈ V)
54		funisfsupp 9313	. . . . 5 ⊢ ((Fun (𝐹 ∪ 𝐺) ∧ (𝐹 ∪ 𝐺) ∈ V ∧ 𝑍 ∈ V) → ((𝐹 ∪ 𝐺) finSupp 𝑍 ↔ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin))
55	45, 50, 53, 54	syl3anc 1390	. . . 4 ⊢ ((𝜑 ∧ (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍)) → ((𝐹 ∪ 𝐺) finSupp 𝑍 ↔ ((𝐹 ∪ 𝐺) supp 𝑍) ∈ Fin))
56	43, 55	mpbird 259	. . 3 ⊢ ((𝜑 ∧ (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍)) → (𝐹 ∪ 𝐺) finSupp 𝑍)
57	56	ex 416	. 2 ⊢ (𝜑 → ((𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍) → (𝐹 ∪ 𝐺) finSupp 𝑍))
58	39, 57	impbid 214	1 ⊢ (𝜑 → ((𝐹 ∪ 𝐺) finSupp 𝑍 ↔ (𝐹 finSupp 𝑍 ∧ 𝐺 finSupp 𝑍)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∈ wcel 2142 Vcvv 3454 ∪ cun 3902 class class class wbr 5100 Fun wfun 6515 (class class class)co 7396 supp csupp 8140 Fincfn 8927 finSupp cfsupp 9307

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-nul 5256 ax-pr 5390 ax-un 7718

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-supp 8141 df-1o 8437 df-en 8928 df-fin 8931 df-fsupp 9308

This theorem is referenced by: funsnfsupp 9338 lbsdiflsp0 33923

W3C validator