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

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

Proof of Theorem mnuprd
StepHypRef Expression
1 mnuprd.1 . . 3 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))}
2 mnuprd.2 . . . 4 (𝜑 → 𝑈 ∈ 𝑀)
32adantr 486 . . 3 ((𝜑 ∧ 𝐴 = ∅) → 𝑈 ∈ 𝑀)
4 mnuprd.4 . . . 4 (𝜑 → 𝐵 ∈ 𝑈)
54adantr 486 . . 3 ((𝜑 ∧ 𝐴 = ∅) → 𝐵 ∈ 𝑈)
6 simpr 490 . . . 4 ((𝜑 ∧ 𝐴 = ∅) → 𝐴 = ∅)
7 0ss 4349 . . . 4 ∅ ⊆ 𝐵
86, 7eqsstrdi 3952 . . 3 ((𝜑 ∧ 𝐴 = ∅) → 𝐴 ⊆ 𝐵)
9 ssidd 3931 . . 3 ((𝜑 ∧ 𝐴 = ∅) → 𝐵 ⊆ 𝐵)
101, 3, 5, 8, 9mnuprssd 45253 . 2 ((𝜑 ∧ 𝐴 = ∅) → {𝐴, 𝐵} ∈ 𝑈)
11 eqid 2760 . . 3 {{∅, {𝐴}}, {{∅}, {𝐵}}} = {{∅, {𝐴}}, {{∅}, {𝐵}}}
122adantr 486 . . 3 ((𝜑 ∧ ¬ 𝐴 = ∅) → 𝑈 ∈ 𝑀)
13 mnuprd.3 . . . 4 (𝜑 → 𝐴 ∈ 𝑈)
1413adantr 486 . . 3 ((𝜑 ∧ ¬ 𝐴 = ∅) → 𝐴 ∈ 𝑈)
154adantr 486 . . 3 ((𝜑 ∧ ¬ 𝐴 = ∅) → 𝐵 ∈ 𝑈)
16 simpr 490 . . 3 ((𝜑 ∧ ¬ 𝐴 = ∅) → ¬ 𝐴 = ∅)
171, 11, 12, 14, 15, 16mnuprdlem4 45259 . 2 ((𝜑 ∧ ¬ 𝐴 = ∅) → {𝐴, 𝐵} ∈ 𝑈)
1810, 17pm2.61dan 825 1 (𝜑 → {𝐴, 𝐵} ∈ 𝑈)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1567   = wceq 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895  ∅c0 4278  𝒫 cpw 4556  {csn 4583  {cpr 4585  ∪ cuni 4866
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-pw 4558  df-sn 4584  df-pr 4586  df-uni 4867
This theorem is used by:  mnuund  45262  mnurndlem2  45266  mnugrud  45268
  Copyright terms: Public domain W3C validator