Theorem mnuprss2d 44302

Description: Special case of mnuprssd 44301. (Contributed by Rohan Ridenour, 13-Aug-2023.)

Hypotheses

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

Assertion

Ref	Expression
mnuprss2d	⊢ (𝜑 → {𝐴, 𝐵} ∈ 𝑈)

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

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

Proof of Theorem mnuprss2d

Step	Hyp	Ref	Expression
1		mnuprss2d.1	. 2 ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))}
2		mnuprss2d.2	. 2 ⊢ (𝜑 → 𝑈 ∈ 𝑀)
3		mnuprss2d.3	. 2 ⊢ (𝜑 → 𝐶 ∈ 𝑈)
4		mnuprss2d.4	. . 3 ⊢ 𝐴 ⊆ 𝐶
5	4	a1i 11	. 2 ⊢ (𝜑 → 𝐴 ⊆ 𝐶)
6		mnuprss2d.5	. . 3 ⊢ 𝐵 ⊆ 𝐶
7	6	a1i 11	. 2 ⊢ (𝜑 → 𝐵 ⊆ 𝐶)
8	1, 2, 3, 5, 7	mnuprssd 44301	1 ⊢ (𝜑 → {𝐴, 𝐵} ∈ 𝑈)

Syntax hints:   → wi 4   ∧ wa 395  ∀wal 1539   = wceq 1541   ∈ wcel 2111  {cab 2709  ∀wral 3047  ∃wrex 3056   ⊆ wss 3902  𝒫 cpw 4550  {cpr 4578  ∪ cuni 4859

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5234  ax-nul 5244

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-pw 4552  df-sn 4577  df-pr 4579  df-uni 4860

This theorem is referenced by:  mnuprdlem4  44307