Theorem founiiun0 45376

Description: Union expressed as an indexed union, when a map onto is given. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Assertion

Ref	Expression
founiiun0	⊢ (𝐹:𝐴–onto→(𝐵 ∪ {∅}) → ∪ 𝐵 = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹

Proof of Theorem founiiun0

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		uniiun 5012	. 2 ⊢ ∪ 𝐵 = ∪ 𝑦 ∈ 𝐵 𝑦
2		elun1 4132	. . . . . . 7 ⊢ (𝑦 ∈ 𝐵 → 𝑦 ∈ (𝐵 ∪ {∅}))
3		foelcdmi 6893	. . . . . . 7 ⊢ ((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ 𝑦 ∈ (𝐵 ∪ {∅})) → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
4	2, 3	sylan2 593	. . . . . 6 ⊢ ((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
5		eqimss2 3991	. . . . . . 7 ⊢ ((𝐹‘𝑥) = 𝑦 → 𝑦 ⊆ (𝐹‘𝑥))
6	5	reximi 3072	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥))
7	4, 6	syl 17	. . . . 5 ⊢ ((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥))
8	7	ralrimiva 3126	. . . 4 ⊢ (𝐹:𝐴–onto→(𝐵 ∪ {∅}) → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥))
9		iunss2 5003	. . . 4 ⊢ (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥) → ∪ 𝑦 ∈ 𝐵 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥))
10	8, 9	syl 17	. . 3 ⊢ (𝐹:𝐴–onto→(𝐵 ∪ {∅}) → ∪ 𝑦 ∈ 𝐵 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥))
11		simpl 482	. . . . . 6 ⊢ ((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ 𝐵 = ∅) → 𝐹:𝐴–onto→(𝐵 ∪ {∅}))
12		uneq1 4111	. . . . . . . . 9 ⊢ (𝐵 = ∅ → (𝐵 ∪ {∅}) = (∅ ∪ {∅}))
13		0un 4346	. . . . . . . . 9 ⊢ (∅ ∪ {∅}) = {∅}
14	12, 13	eqtrdi 2785	. . . . . . . 8 ⊢ (𝐵 = ∅ → (𝐵 ∪ {∅}) = {∅})
15	14	adantl 481	. . . . . . 7 ⊢ ((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ 𝐵 = ∅) → (𝐵 ∪ {∅}) = {∅})
16		foeq3 6742	. . . . . . 7 ⊢ ((𝐵 ∪ {∅}) = {∅} → (𝐹:𝐴–onto→(𝐵 ∪ {∅}) ↔ 𝐹:𝐴–onto→{∅}))
17	15, 16	syl 17	. . . . . 6 ⊢ ((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ 𝐵 = ∅) → (𝐹:𝐴–onto→(𝐵 ∪ {∅}) ↔ 𝐹:𝐴–onto→{∅}))
18	11, 17	mpbid 232	. . . . 5 ⊢ ((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ 𝐵 = ∅) → 𝐹:𝐴–onto→{∅})
19		founiiun 45365	. . . . . . 7 ⊢ (𝐹:𝐴–onto→{∅} → ∪ {∅} = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥))
20		unisn0 45241	. . . . . . 7 ⊢ ∪ {∅} = ∅
21	19, 20	eqtr3di 2784	. . . . . 6 ⊢ (𝐹:𝐴–onto→{∅} → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) = ∅)
22		0ss 4350	. . . . . 6 ⊢ ∅ ⊆ ∪ 𝑦 ∈ 𝐵 𝑦
23	21, 22	eqsstrdi 3976	. . . . 5 ⊢ (𝐹:𝐴–onto→{∅} → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) ⊆ ∪ 𝑦 ∈ 𝐵 𝑦)
24	18, 23	syl 17	. . . 4 ⊢ ((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ 𝐵 = ∅) → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) ⊆ ∪ 𝑦 ∈ 𝐵 𝑦)
25		ssid 3954	. . . . . . . . 9 ⊢ (𝐹‘𝑥) ⊆ (𝐹‘𝑥)
26		sseq2 3958	. . . . . . . . . 10 ⊢ (𝑦 = (𝐹‘𝑥) → ((𝐹‘𝑥) ⊆ 𝑦 ↔ (𝐹‘𝑥) ⊆ (𝐹‘𝑥)))
27	26	rspcev 3574	. . . . . . . . 9 ⊢ (((𝐹‘𝑥) ∈ 𝐵 ∧ (𝐹‘𝑥) ⊆ (𝐹‘𝑥)) → ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦)
28	25, 27	mpan2 691	. . . . . . . 8 ⊢ ((𝐹‘𝑥) ∈ 𝐵 → ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦)
29	28	adantl 481	. . . . . . 7 ⊢ ((((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ ¬ 𝐵 = ∅) ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦)
30		fof 6744	. . . . . . . . . . . 12 ⊢ (𝐹:𝐴–onto→(𝐵 ∪ {∅}) → 𝐹:𝐴⟶(𝐵 ∪ {∅}))
31	30	ffvelcdmda 7027	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ (𝐵 ∪ {∅}))
32		elunnel1 4104	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑥) ∈ (𝐵 ∪ {∅}) ∧ ¬ (𝐹‘𝑥) ∈ 𝐵) → (𝐹‘𝑥) ∈ {∅})
33	31, 32	sylan 580	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ 𝑥 ∈ 𝐴) ∧ ¬ (𝐹‘𝑥) ∈ 𝐵) → (𝐹‘𝑥) ∈ {∅})
34		elsni 4595	. . . . . . . . . 10 ⊢ ((𝐹‘𝑥) ∈ {∅} → (𝐹‘𝑥) = ∅)
35	33, 34	syl 17	. . . . . . . . 9 ⊢ (((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ 𝑥 ∈ 𝐴) ∧ ¬ (𝐹‘𝑥) ∈ 𝐵) → (𝐹‘𝑥) = ∅)
36	35	adantllr 719	. . . . . . . 8 ⊢ ((((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ ¬ 𝐵 = ∅) ∧ 𝑥 ∈ 𝐴) ∧ ¬ (𝐹‘𝑥) ∈ 𝐵) → (𝐹‘𝑥) = ∅)
37		neq0 4302	. . . . . . . . . . . . 13 ⊢ (¬ 𝐵 = ∅ ↔ ∃𝑦 𝑦 ∈ 𝐵)
38	37	biimpi 216	. . . . . . . . . . . 12 ⊢ (¬ 𝐵 = ∅ → ∃𝑦 𝑦 ∈ 𝐵)
39	38	adantr 480	. . . . . . . . . . 11 ⊢ ((¬ 𝐵 = ∅ ∧ (𝐹‘𝑥) = ∅) → ∃𝑦 𝑦 ∈ 𝐵)
40		id 22	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹‘𝑥) = ∅ → (𝐹‘𝑥) = ∅)
41		0ss 4350	. . . . . . . . . . . . . . . 16 ⊢ ∅ ⊆ 𝑦
42	40, 41	eqsstrdi 3976	. . . . . . . . . . . . . . 15 ⊢ ((𝐹‘𝑥) = ∅ → (𝐹‘𝑥) ⊆ 𝑦)
43	42	anim1ci 616	. . . . . . . . . . . . . 14 ⊢ (((𝐹‘𝑥) = ∅ ∧ 𝑦 ∈ 𝐵) → (𝑦 ∈ 𝐵 ∧ (𝐹‘𝑥) ⊆ 𝑦))
44	43	ex 412	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑥) = ∅ → (𝑦 ∈ 𝐵 → (𝑦 ∈ 𝐵 ∧ (𝐹‘𝑥) ⊆ 𝑦)))
45	44	adantl 481	. . . . . . . . . . . 12 ⊢ ((¬ 𝐵 = ∅ ∧ (𝐹‘𝑥) = ∅) → (𝑦 ∈ 𝐵 → (𝑦 ∈ 𝐵 ∧ (𝐹‘𝑥) ⊆ 𝑦)))
46	45	eximdv 1918	. . . . . . . . . . 11 ⊢ ((¬ 𝐵 = ∅ ∧ (𝐹‘𝑥) = ∅) → (∃𝑦 𝑦 ∈ 𝐵 → ∃𝑦(𝑦 ∈ 𝐵 ∧ (𝐹‘𝑥) ⊆ 𝑦)))
47	39, 46	mpd 15	. . . . . . . . . 10 ⊢ ((¬ 𝐵 = ∅ ∧ (𝐹‘𝑥) = ∅) → ∃𝑦(𝑦 ∈ 𝐵 ∧ (𝐹‘𝑥) ⊆ 𝑦))
48		df-rex 3059	. . . . . . . . . 10 ⊢ (∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦 ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ (𝐹‘𝑥) ⊆ 𝑦))
49	47, 48	sylibr 234	. . . . . . . . 9 ⊢ ((¬ 𝐵 = ∅ ∧ (𝐹‘𝑥) = ∅) → ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦)
50	49	ad4ant24 754	. . . . . . . 8 ⊢ ((((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ ¬ 𝐵 = ∅) ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) = ∅) → ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦)
51	36, 50	syldan 591	. . . . . . 7 ⊢ ((((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ ¬ 𝐵 = ∅) ∧ 𝑥 ∈ 𝐴) ∧ ¬ (𝐹‘𝑥) ∈ 𝐵) → ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦)
52	29, 51	pm2.61dan 812	. . . . . 6 ⊢ (((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ ¬ 𝐵 = ∅) ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦)
53	52	ralrimiva 3126	. . . . 5 ⊢ ((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ ¬ 𝐵 = ∅) → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦)
54		iunss2 5003	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) ⊆ ∪ 𝑦 ∈ 𝐵 𝑦)
55	53, 54	syl 17	. . . 4 ⊢ ((𝐹:𝐴–onto→(𝐵 ∪ {∅}) ∧ ¬ 𝐵 = ∅) → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) ⊆ ∪ 𝑦 ∈ 𝐵 𝑦)
56	24, 55	pm2.61dan 812	. . 3 ⊢ (𝐹:𝐴–onto→(𝐵 ∪ {∅}) → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) ⊆ ∪ 𝑦 ∈ 𝐵 𝑦)
57	10, 56	eqssd 3949	. 2 ⊢ (𝐹:𝐴–onto→(𝐵 ∪ {∅}) → ∪ 𝑦 ∈ 𝐵 𝑦 = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥))
58	1, 57	eqtrid 2781	1 ⊢ (𝐹:𝐴–onto→(𝐵 ∪ {∅}) → ∪ 𝐵 = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541  ∃wex 1780   ∈ wcel 2113  ∀wral 3049  ∃wrex 3058   ∪ cun 3897   ⊆ wss 3899  ∅c0 4283  {csn 4578  ∪ cuni 4861  ∪ ciun 4944  –onto→wfo 6488  ‘cfv 6490

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-fo 6496  df-fv 6498

This theorem is referenced by:  ismeannd  46653