Theorem mnuund 45065

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

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2146  {cab 2743  ∀wral 3081  ∃wrex 3091   ∪ cun 3904   ⊆ wss 3906  𝒫 cpw 4564  {cpr 4593  ∪ cuni 4874

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-10 2179  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-pw 4566  df-sn 4592  df-pr 4594  df-uni 4875

This theorem is used by: (None)