Theorem mnuund 40688

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

Hypotheses

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

Assertion

Ref	Expression
mnuund	⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ 𝑈)

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

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

Proof of Theorem mnuund

Step	Hyp	Ref	Expression
1		mnuund.3	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
2		mnuund.4	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑈)
3		uniprg 4849	. . 3 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵))
4	1, 2, 3	syl2anc 586	. 2 ⊢ (𝜑 → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵))
5		mnuund.1	. . 3 ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))}
6		mnuund.2	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑀)
7	5, 6, 1, 2	mnuprd 40686	. . 3 ⊢ (𝜑 → {𝐴, 𝐵} ∈ 𝑈)
8	5, 6, 7	mnuunid 40687	. 2 ⊢ (𝜑 → ∪ {𝐴, 𝐵} ∈ 𝑈)
9	4, 8	eqeltrrd 2913	1 ⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ 𝑈)

Syntax hints:   → wi 4   ∧ wa 398  ∀wal 1534   = wceq 1536   ∈ wcel 2113  {cab 2798  ∀wral 3137  ∃wrex 3138   ∪ cun 3927   ⊆ wss 3929  𝒫 cpw 4532  {cpr 4562  ∪ cuni 4831

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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5323

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ne 3016  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3493  df-sbc 3769  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-pw 4534  df-sn 4561  df-pr 4563  df-uni 4832

This theorem is referenced by: (None)