Theorem mnuund 44914

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 4892	. . 3 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵))
4	1, 2, 3	syl2anc 595	. 2 ⊢ (𝜑 → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵))
5		mnuund.1	. . 3 ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))}
6		mnuund.2	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑀)
7	5, 6, 1, 2	mnuprd 44912	. . 3 ⊢ (𝜑 → {𝐴, 𝐵} ∈ 𝑈)
8	5, 6, 7	mnuunid 44913	. 2 ⊢ (𝜑 → ∪ {𝐴, 𝐵} ∈ 𝑈)
9	4, 8	eqeltrrd 2870	1 ⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ 𝑈)

Syntax hints:   → wi 4   ∧ wa 400  ∀wal 1565   = wceq 1567   ∈ wcel 2149  {cab 2747  ∀wral 3085  ∃wrex 3095   ∪ cun 3911   ⊆ wss 3913  𝒫 cpw 4567  {cpr 4596  ∪ cuni 4876

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-pw 4569  df-sn 4595  df-pr 4597  df-uni 4877

This theorem is referenced by: (None)