Theorem mnuund 40986

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

Syntax hints:   → wi 4   ∧ wa 399  ∀wal 1536   = wceq 1538   ∈ wcel 2111  {cab 2776  ∀wral 3106  ∃wrex 3107   ∪ cun 3879   ⊆ wss 3881  𝒫 cpw 4497  {cpr 4527  ∪ cuni 4800

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-pw 4499  df-sn 4526  df-pr 4528  df-uni 4801

This theorem is referenced by: (None)