Theorem mnuunid 45028

Description: Minimal universes are closed under union. (Contributed by Rohan Ridenour, 13-Aug-2023.)

Hypotheses

Ref	Expression
mnuunid.1	⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))}
mnuunid.2	⊢ (𝜑 → 𝑈 ∈ 𝑀)
mnuunid.3	⊢ (𝜑 → 𝐴 ∈ 𝑈)

Assertion

Ref	Expression
mnuunid	⊢ (𝜑 → ∪ 𝐴 ∈ 𝑈)

Distinct variable groups:   𝑈,𝑘,𝑚,𝑛,𝑞,𝑝,𝑙   𝑈,𝑟,𝑘,𝑚,𝑛,𝑝,𝑙

Allowed substitution hints:   𝜑(𝑘, 𝑚, 𝑛, 𝑟, 𝑞, 𝑝, 𝑙)   𝐴(𝑘, 𝑚, 𝑛, 𝑟, 𝑞, 𝑝, 𝑙)   𝑀(𝑘, 𝑚, 𝑛, 𝑟, 𝑞, 𝑝, 𝑙)

Proof of Theorem mnuunid

Dummy variables 𝑣 𝑎 𝑤 𝑖 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		mnuunid.1	. 2 ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))}
2		mnuunid.2	. 2 ⊢ (𝜑 → 𝑈 ∈ 𝑀)
3		mnuunid.3	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
4	3	snssd 4757	. . . 4 ⊢ (𝜑 → {𝐴} ⊆ 𝑈)
5	1, 2, 3, 4	mnuop3d 45022	. . 3 ⊢ (𝜑 → ∃𝑤 ∈ 𝑈 ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))
6		simprl 783	. . . 4 ⊢ ((𝜑 ∧ (𝑤 ∈ 𝑈 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))) → 𝑤 ∈ 𝑈)
7		sseq2 3966	. . . . 5 ⊢ (𝑎 = 𝑤 → (∪ 𝐴 ⊆ 𝑎 ↔ ∪ 𝐴 ⊆ 𝑤))
8	7	adantl 487	. . . 4 ⊢ (((𝜑 ∧ (𝑤 ∈ 𝑈 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))) ∧ 𝑎 = 𝑤) → (∪ 𝐴 ⊆ 𝑎 ↔ ∪ 𝐴 ⊆ 𝑤))
9		elssuni 4909	. . . . . . 7 ⊢ (𝑖 ∈ 𝐴 → 𝑖 ⊆ ∪ 𝐴)
10	9	rgen 3084	. . . . . 6 ⊢ ∀𝑖 ∈ 𝐴 𝑖 ⊆ ∪ 𝐴
11		simprr 785	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 ∈ 𝑈 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))) → ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))
12		eleq2 2855	. . . . . . . . . . . . . . 15 ⊢ (𝑣 = 𝐴 → (𝑖 ∈ 𝑣 ↔ 𝑖 ∈ 𝐴))
13	12	rexsng 4647	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑈 → (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 ↔ 𝑖 ∈ 𝐴))
14	3, 13	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 ↔ 𝑖 ∈ 𝐴))
15		eleq2 2855	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 = 𝐴 → (𝑖 ∈ 𝑢 ↔ 𝑖 ∈ 𝐴))
16		unieq 4888	. . . . . . . . . . . . . . . . 17 ⊢ (𝑢 = 𝐴 → ∪ 𝑢 = ∪ 𝐴)
17	16	sseq1d 3971	. . . . . . . . . . . . . . . 16 ⊢ (𝑢 = 𝐴 → (∪ 𝑢 ⊆ 𝑤 ↔ ∪ 𝐴 ⊆ 𝑤))
18	15, 17	anbi12d 644	. . . . . . . . . . . . . . 15 ⊢ (𝑢 = 𝐴 → ((𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤) ↔ (𝑖 ∈ 𝐴 ∧ ∪ 𝐴 ⊆ 𝑤)))
19	18	rexsng 4647	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ 𝑈 → (∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤) ↔ (𝑖 ∈ 𝐴 ∧ ∪ 𝐴 ⊆ 𝑤)))
20	3, 19	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → (∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤) ↔ (𝑖 ∈ 𝐴 ∧ ∪ 𝐴 ⊆ 𝑤)))
21	14, 20	imbi12d 347	. . . . . . . . . . . 12 ⊢ (𝜑 → ((∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)) ↔ (𝑖 ∈ 𝐴 → (𝑖 ∈ 𝐴 ∧ ∪ 𝐴 ⊆ 𝑤))))
22		anclb 555	. . . . . . . . . . . 12 ⊢ ((𝑖 ∈ 𝐴 → ∪ 𝐴 ⊆ 𝑤) ↔ (𝑖 ∈ 𝐴 → (𝑖 ∈ 𝐴 ∧ ∪ 𝐴 ⊆ 𝑤)))
23	21, 22	bitr4di 292	. . . . . . . . . . 11 ⊢ (𝜑 → ((∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)) ↔ (𝑖 ∈ 𝐴 → ∪ 𝐴 ⊆ 𝑤)))
24	23	imbi2d 343	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑖 ∈ 𝐴 → (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))) ↔ (𝑖 ∈ 𝐴 → (𝑖 ∈ 𝐴 → ∪ 𝐴 ⊆ 𝑤))))
25		pm5.4 393	. . . . . . . . . 10 ⊢ ((𝑖 ∈ 𝐴 → (𝑖 ∈ 𝐴 → ∪ 𝐴 ⊆ 𝑤)) ↔ (𝑖 ∈ 𝐴 → ∪ 𝐴 ⊆ 𝑤))
26	24, 25	bitrdi 290	. . . . . . . . 9 ⊢ (𝜑 → ((𝑖 ∈ 𝐴 → (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))) ↔ (𝑖 ∈ 𝐴 → ∪ 𝐴 ⊆ 𝑤)))
27	26	ralbidv2 3187	. . . . . . . 8 ⊢ (𝜑 → (∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)) ↔ ∀𝑖 ∈ 𝐴 ∪ 𝐴 ⊆ 𝑤))
28	27	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑤 ∈ 𝑈 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))) → (∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)) ↔ ∀𝑖 ∈ 𝐴 ∪ 𝐴 ⊆ 𝑤))
29	11, 28	mpbid 235	. . . . . 6 ⊢ ((𝜑 ∧ (𝑤 ∈ 𝑈 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))) → ∀𝑖 ∈ 𝐴 ∪ 𝐴 ⊆ 𝑤)
30		sstr2 3947	. . . . . . 7 ⊢ (𝑖 ⊆ ∪ 𝐴 → (∪ 𝐴 ⊆ 𝑤 → 𝑖 ⊆ 𝑤))
31	30	ral2imi 3107	. . . . . 6 ⊢ (∀𝑖 ∈ 𝐴 𝑖 ⊆ ∪ 𝐴 → (∀𝑖 ∈ 𝐴 ∪ 𝐴 ⊆ 𝑤 → ∀𝑖 ∈ 𝐴 𝑖 ⊆ 𝑤))
32	10, 29, 31	mpsyl 69	. . . . 5 ⊢ ((𝜑 ∧ (𝑤 ∈ 𝑈 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))) → ∀𝑖 ∈ 𝐴 𝑖 ⊆ 𝑤)
33		unissb 4911	. . . . 5 ⊢ (∪ 𝐴 ⊆ 𝑤 ↔ ∀𝑖 ∈ 𝐴 𝑖 ⊆ 𝑤)
34	32, 33	sylibr 237	. . . 4 ⊢ ((𝜑 ∧ (𝑤 ∈ 𝑈 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))) → ∪ 𝐴 ⊆ 𝑤)
35	6, 8, 34	rspcedvd 3586	. . 3 ⊢ ((𝜑 ∧ (𝑤 ∈ 𝑈 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ {𝐴}𝑖 ∈ 𝑣 → ∃𝑢 ∈ {𝐴} (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))) → ∃𝑎 ∈ 𝑈 ∪ 𝐴 ⊆ 𝑎)
36	5, 35	rexlimddv 3175	. 2 ⊢ (𝜑 → ∃𝑎 ∈ 𝑈 ∪ 𝐴 ⊆ 𝑎)
37	1, 2, 36	mnuss2d 45015	1 ⊢ (𝜑 → ∪ 𝐴 ∈ 𝑈)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2146  {cab 2744  ∀wral 3082  ∃wrex 3092   ⊆ wss 3908  𝒫 cpw 4567  {csn 4594  ∪ cuni 4877

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-ext 2738  ax-sep 5262

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-in 3915  df-ss 3925  df-pw 4569  df-sn 4595  df-uni 4878

This theorem is used by:  mnuund  45029  mnutrcld  45030  mnugrud  45035