Theorem mnuop3d 45014

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 5301	. . 3 ⊢ (𝜑 → 𝐹 ∈ 𝒫 𝑈)
6	1, 2, 3, 5	mnuop23d 45009	. 2 ⊢ (𝜑 → ∃𝑤 ∈ 𝑈 (𝒫 𝐴 ⊆ 𝑤 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
7	4	sseld 3937	. . . . . . . . 9 ⊢ (𝜑 → (𝑣 ∈ 𝐹 → 𝑣 ∈ 𝑈))
8	7	adantrd 497	. . . . . . . 8 ⊢ (𝜑 → ((𝑣 ∈ 𝐹 ∧ 𝑖 ∈ 𝑣) → 𝑣 ∈ 𝑈))
9		pm3.22 465	. . . . . . . 8 ⊢ ((𝑣 ∈ 𝐹 ∧ 𝑖 ∈ 𝑣) → (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹))
10	8, 9	jca2 523	. . . . . . 7 ⊢ (𝜑 → ((𝑣 ∈ 𝐹 ∧ 𝑖 ∈ 𝑣) → (𝑣 ∈ 𝑈 ∧ (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹))))
11	10	reximdv2 3177	. . . . . 6 ⊢ (𝜑 → (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹)))
12	11	imim1d 83	. . . . 5 ⊢ (𝜑 → ((∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)) → (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
13	12	ralimdv 3181	. . . 4 ⊢ (𝜑 → (∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)) → ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
14	13	adantld 496	. . 3 ⊢ (𝜑 → ((𝒫 𝐴 ⊆ 𝑤 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))) → ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
15	14	reximdv 3182	. 2 ⊢ (𝜑 → (∃𝑤 ∈ 𝑈 (𝒫 𝐴 ⊆ 𝑤 ∧ ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝑈 (𝑖 ∈ 𝑣 ∧ 𝑣 ∈ 𝐹) → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))) → ∃𝑤 ∈ 𝑈 ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤))))
16	6, 15	mpd 16	1 ⊢ (𝜑 → ∃𝑤 ∈ 𝑈 ∀𝑖 ∈ 𝐴 (∃𝑣 ∈ 𝐹 𝑖 ∈ 𝑣 → ∃𝑢 ∈ 𝐹 (𝑖 ∈ 𝑢 ∧ ∪ 𝑢 ⊆ 𝑤)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2146  {cab 2743  ∀wral 3081  ∃wrex 3091   ⊆ wss 3906  𝒫 cpw 4564  ∪ 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-ext 2737  ax-sep 5259

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-in 3913  df-ss 3923  df-pw 4566  df-uni 4875

This theorem is used by:  mnuprdlem4  45018  mnuunid  45020  mnurndlem2  45025