Theorem mnuop3d 44304

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 5261	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝒫 𝑈)
6	1, 2, 3, 5	mnuop23d 44299	. 2 ⊢ (𝜑 → ∃𝑤 ∈ 𝑈 (𝒫 𝐴 ⊆ 𝑤 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
7	4	sseld 3928	. . . . . . . . 9 ⊢ (𝜑 → (𝑣 ∈ 𝐹 → 𝑣 ∈ 𝑈))
8	7	adantrd 491	. . . . . . . 8 ⊢ (𝜑 → ((𝑣 ∈ 𝐹 ∧ 𝑖 ∈ 𝑣) → 𝑣 ∈ 𝑈))
9		pm3.22 459	. . . . . . . 8 ⊢ ((𝑣 ∈ 𝐹 ∧ 𝑖 ∈ 𝑣) → (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹))
10	8, 9	jca2 513	. . . . . . 7 ⊢ (𝜑 → ((𝑣 ∈ 𝐹 ∧ 𝑖 ∈ 𝑣) → (𝑣 ∈ 𝑈 ∧ (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹))))
11	10	reximdv2 3142	. . . . . 6 ⊢ (𝜑 → (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹)))
12	11	imim1d 82	. . . . 5 ⊢ (𝜑 → ((∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)) → (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
13	12	ralimdv 3146	. . . 4 ⊢ (𝜑 → (∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)) → ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
14	13	adantld 490	. . 3 ⊢ (𝜑 → ((𝒫 𝐴 ⊆ 𝑤 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))) → ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
15	14	reximdv 3147	. 2 ⊢ (𝜑 → (∃𝑤 ∈ 𝑈 (𝒫 𝐴 ⊆ 𝑤 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))) → ∃𝑤 ∈ 𝑈 ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
16	6, 15	mpd 15	1 ⊢ (𝜑 → ∃𝑤 ∈ 𝑈 ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))

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

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 5229

This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1088  df-tru 1544  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-in 3904  df-ss 3914  df-pw 4547  df-uni 4855

This theorem is referenced by:  mnuprdlem4  44308  mnuunid  44310  mnurndlem2  44315