Theorem mnuop3d 44866

Description: Third operation of a minimal universe. (Contributed by Rohan Ridenour, 13-Aug-2023.)

Hypotheses

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

Assertion

Ref	Expression
mnuop3d	⊢ (𝜑 → ∃𝑤 ∈ 𝑈 ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))

Distinct variable groups:   𝑣,𝐹   𝑤,𝐴,𝑖   𝜑,𝑤,𝑣,𝑖   𝑤,𝑢,𝐹,𝑖   𝑤,𝑈,𝑘,𝑚,𝑛,𝑞,𝑝,𝑙,𝑣,𝑖   𝑤,𝑟   𝑢,𝑈,𝑘,𝑚,𝑛,𝑟,𝑝,𝑙,𝑖

Allowed substitution hints:   𝜑(𝑢,𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)   𝐴(𝑣,𝑢,𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)   𝐹(𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)   𝑀(𝑤,𝑣,𝑢,𝑖,𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)

Proof of Theorem mnuop3d

Step	Hyp	Ref	Expression
1		mnuop3d.1	. . 3 ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))}
2		mnuop3d.2	. . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑀)
3		mnuop3d.3	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑈)
4		mnuop3d.4	. . . 4 ⊢ (𝜑 → 𝐹 ⊆ 𝑈)
5	2, 4	sselpwd 5296	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝒫 𝑈)
6	1, 2, 3, 5	mnuop23d 44861	. 2 ⊢ (𝜑 → ∃𝑤 ∈ 𝑈 (𝒫 𝐴 ⊆ 𝑤 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
7	4	sseld 3944	. . . . . . . . 9 ⊢ (𝜑 → (𝑣 ∈ 𝐹 → 𝑣 ∈ 𝑈))
8	7	adantrd 496	. . . . . . . 8 ⊢ (𝜑 → ((𝑣 ∈ 𝐹 ∧ 𝑖 ∈ 𝑣) → 𝑣 ∈ 𝑈))
9		pm3.22 464	. . . . . . . 8 ⊢ ((𝑣 ∈ 𝐹 ∧ 𝑖 ∈ 𝑣) → (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹))
10	8, 9	jca2 522	. . . . . . 7 ⊢ (𝜑 → ((𝑣 ∈ 𝐹 ∧ 𝑖 ∈ 𝑣) → (𝑣 ∈ 𝑈 ∧ (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹))))
11	10	reximdv2 3181	. . . . . 6 ⊢ (𝜑 → (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹)))
12	11	imim1d 83	. . . . 5 ⊢ (𝜑 → ((∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)) → (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
13	12	ralimdv 3185	. . . 4 ⊢ (𝜑 → (∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)) → ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
14	13	adantld 495	. . 3 ⊢ (𝜑 → ((𝒫 𝐴 ⊆ 𝑤 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))) → ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
15	14	reximdv 3186	. 2 ⊢ (𝜑 → (∃𝑤 ∈ 𝑈 (𝒫 𝐴 ⊆ 𝑤 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))) → ∃𝑤 ∈ 𝑈 ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
16	6, 15	mpd 16	1 ⊢ (𝜑 → ∃𝑤 ∈ 𝑈 ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))

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

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-ext 2741  ax-sep 5258

This theorem depends on definitions:  df-bi 210  df-an 401  df-3an 1103  df-tru 1570  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-in 3920  df-ss 3930  df-pw 4566  df-uni 4874

This theorem is referenced by:  mnuprdlem4  44870  mnuunid  44872  mnurndlem2  44877