Users' Mathboxes Mathbox for Rohan Ridenour < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mnuunid Structured version   Visualization version   GIF version

Theorem mnuunid 44970
Description: Minimal universes are closed under union. (Contributed by Rohan Ridenour, 13-Aug-2023.)
Hypotheses
Ref Expression
mnuunid.1 𝑀 = {𝑘 ∣ ∀𝑙𝑘 (𝒫 𝑙𝑘 ∧ ∀𝑚𝑛𝑘 (𝒫 𝑙𝑛 ∧ ∀𝑝𝑙 (∃𝑞𝑘 (𝑝𝑞𝑞𝑚) → ∃𝑟𝑚 (𝑝𝑟 𝑟𝑛))))}
mnuunid.2 (𝜑𝑈𝑀)
mnuunid.3 (𝜑𝐴𝑈)
Assertion
Ref Expression
mnuunid (𝜑 𝐴𝑈)
Distinct variable groups:   𝑈,𝑘,𝑚,𝑛,𝑞,𝑝,𝑙   𝑈,𝑟,𝑘,𝑚,𝑛,𝑝,𝑙
Allowed substitution hints:   𝜑(𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)   𝐴(𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)   𝑀(𝑘,𝑚,𝑛,𝑟,𝑞,𝑝,𝑙)

Proof of Theorem mnuunid
Dummy variables 𝑣 𝑎 𝑤 𝑖 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mnuunid.1 . 2 𝑀 = {𝑘 ∣ ∀𝑙𝑘 (𝒫 𝑙𝑘 ∧ ∀𝑚𝑛𝑘 (𝒫 𝑙𝑛 ∧ ∀𝑝𝑙 (∃𝑞𝑘 (𝑝𝑞𝑞𝑚) → ∃𝑟𝑚 (𝑝𝑟 𝑟𝑛))))}
2 mnuunid.2 . 2 (𝜑𝑈𝑀)
3 mnuunid.3 . . . 4 (𝜑𝐴𝑈)
43snssd 4753 . . . 4 (𝜑 → {𝐴} ⊆ 𝑈)
51, 2, 3, 4mnuop3d 44964 . . 3 (𝜑 → ∃𝑤𝑈𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)))
6 simprl 782 . . . 4 ((𝜑 ∧ (𝑤𝑈 ∧ ∀𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)))) → 𝑤𝑈)
7 sseq2 3964 . . . . 5 (𝑎 = 𝑤 → ( 𝐴𝑎 𝐴𝑤))
87adantl 486 . . . 4 (((𝜑 ∧ (𝑤𝑈 ∧ ∀𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)))) ∧ 𝑎 = 𝑤) → ( 𝐴𝑎 𝐴𝑤))
9 elssuni 4905 . . . . . . 7 (𝑖𝐴𝑖 𝐴)
109rgen 3081 . . . . . 6 𝑖𝐴 𝑖 𝐴
11 simprr 784 . . . . . . 7 ((𝜑 ∧ (𝑤𝑈 ∧ ∀𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)))) → ∀𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)))
12 eleq2 2852 . . . . . . . . . . . . . . 15 (𝑣 = 𝐴 → (𝑖𝑣𝑖𝐴))
1312rexsng 4643 . . . . . . . . . . . . . 14 (𝐴𝑈 → (∃𝑣 ∈ {𝐴}𝑖𝑣𝑖𝐴))
143, 13syl 18 . . . . . . . . . . . . 13 (𝜑 → (∃𝑣 ∈ {𝐴}𝑖𝑣𝑖𝐴))
15 eleq2 2852 . . . . . . . . . . . . . . . 16 (𝑢 = 𝐴 → (𝑖𝑢𝑖𝐴))
16 unieq 4884 . . . . . . . . . . . . . . . . 17 (𝑢 = 𝐴 𝑢 = 𝐴)
1716sseq1d 3969 . . . . . . . . . . . . . . . 16 (𝑢 = 𝐴 → ( 𝑢𝑤 𝐴𝑤))
1815, 17anbi12d 643 . . . . . . . . . . . . . . 15 (𝑢 = 𝐴 → ((𝑖𝑢 𝑢𝑤) ↔ (𝑖𝐴 𝐴𝑤)))
1918rexsng 4643 . . . . . . . . . . . . . 14 (𝐴𝑈 → (∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤) ↔ (𝑖𝐴 𝐴𝑤)))
203, 19syl 18 . . . . . . . . . . . . 13 (𝜑 → (∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤) ↔ (𝑖𝐴 𝐴𝑤)))
2114, 20imbi12d 347 . . . . . . . . . . . 12 (𝜑 → ((∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)) ↔ (𝑖𝐴 → (𝑖𝐴 𝐴𝑤))))
22 anclb 554 . . . . . . . . . . . 12 ((𝑖𝐴 𝐴𝑤) ↔ (𝑖𝐴 → (𝑖𝐴 𝐴𝑤)))
2321, 22bitr4di 292 . . . . . . . . . . 11 (𝜑 → ((∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)) ↔ (𝑖𝐴 𝐴𝑤)))
2423imbi2d 343 . . . . . . . . . 10 (𝜑 → ((𝑖𝐴 → (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤))) ↔ (𝑖𝐴 → (𝑖𝐴 𝐴𝑤))))
25 pm5.4 392 . . . . . . . . . 10 ((𝑖𝐴 → (𝑖𝐴 𝐴𝑤)) ↔ (𝑖𝐴 𝐴𝑤))
2624, 25bitrdi 290 . . . . . . . . 9 (𝜑 → ((𝑖𝐴 → (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤))) ↔ (𝑖𝐴 𝐴𝑤)))
2726ralbidv2 3184 . . . . . . . 8 (𝜑 → (∀𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)) ↔ ∀𝑖𝐴 𝐴𝑤))
2827adantr 485 . . . . . . 7 ((𝜑 ∧ (𝑤𝑈 ∧ ∀𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)))) → (∀𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)) ↔ ∀𝑖𝐴 𝐴𝑤))
2911, 28mpbid 235 . . . . . 6 ((𝜑 ∧ (𝑤𝑈 ∧ ∀𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)))) → ∀𝑖𝐴 𝐴𝑤)
30 sstr2 3945 . . . . . . 7 (𝑖 𝐴 → ( 𝐴𝑤𝑖𝑤))
3130ral2imi 3104 . . . . . 6 (∀𝑖𝐴 𝑖 𝐴 → (∀𝑖𝐴 𝐴𝑤 → ∀𝑖𝐴 𝑖𝑤))
3210, 29, 31mpsyl 69 . . . . 5 ((𝜑 ∧ (𝑤𝑈 ∧ ∀𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)))) → ∀𝑖𝐴 𝑖𝑤)
33 unissb 4907 . . . . 5 ( 𝐴𝑤 ↔ ∀𝑖𝐴 𝑖𝑤)
3432, 33sylibr 237 . . . 4 ((𝜑 ∧ (𝑤𝑈 ∧ ∀𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)))) → 𝐴𝑤)
356, 8, 34rspcedvd 3584 . . 3 ((𝜑 ∧ (𝑤𝑈 ∧ ∀𝑖𝐴 (∃𝑣 ∈ {𝐴}𝑖𝑣 → ∃𝑢 ∈ {𝐴} (𝑖𝑢 𝑢𝑤)))) → ∃𝑎𝑈 𝐴𝑎)
365, 35rexlimddv 3172 . 2 (𝜑 → ∃𝑎𝑈 𝐴𝑎)
371, 2, 36mnuss2d 44957 1 (𝜑 𝐴𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wal 1568   = wceq 1570  wcel 2143  {cab 2741  wral 3079  wrex 3089  wss 3906  𝒫 cpw 4563  {csn 4590   cuni 4873
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5258
This theorem depends on definitions:  df-bi 210  df-an 401  df-3an 1105  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-in 3913  df-ss 3923  df-pw 4565  df-sn 4591  df-uni 4874
This theorem is referenced by:  mnuund  44971  mnutrcld  44972  mnugrud  44977
  Copyright terms: Public domain W3C validator