![]() |
Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > mnuund | Structured version Visualization version GIF version |
Description: Minimal universes are closed under binary unions. (Contributed by Rohan Ridenour, 13-Aug-2023.) |
Ref | Expression |
---|---|
mnuund.1 | ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))} |
mnuund.2 | ⊢ (𝜑 → 𝑈 ∈ 𝑀) |
mnuund.3 | ⊢ (𝜑 → 𝐴 ∈ 𝑈) |
mnuund.4 | ⊢ (𝜑 → 𝐵 ∈ 𝑈) |
Ref | Expression |
---|---|
mnuund | ⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ 𝑈) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mnuund.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑈) | |
2 | mnuund.4 | . . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑈) | |
3 | uniprg 4947 | . . 3 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) | |
4 | 1, 2, 3 | syl2anc 583 | . 2 ⊢ (𝜑 → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) |
5 | mnuund.1 | . . 3 ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))} | |
6 | mnuund.2 | . . 3 ⊢ (𝜑 → 𝑈 ∈ 𝑀) | |
7 | 5, 6, 1, 2 | mnuprd 44245 | . . 3 ⊢ (𝜑 → {𝐴, 𝐵} ∈ 𝑈) |
8 | 5, 6, 7 | mnuunid 44246 | . 2 ⊢ (𝜑 → ∪ {𝐴, 𝐵} ∈ 𝑈) |
9 | 4, 8 | eqeltrrd 2845 | 1 ⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∀wal 1535 = wceq 1537 ∈ wcel 2108 {cab 2717 ∀wral 3067 ∃wrex 3076 ∪ cun 3974 ⊆ wss 3976 𝒫 cpw 4622 {cpr 4650 ∪ cuni 4931 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-pw 4624 df-sn 4649 df-pr 4651 df-uni 4932 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |