![]() |
Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > mnuprss2d | Structured version Visualization version GIF version |
Description: Special case of mnuprssd 40977. (Contributed by Rohan Ridenour, 13-Aug-2023.) |
Ref | Expression |
---|---|
mnuprss2d.1 | ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))} |
mnuprss2d.2 | ⊢ (𝜑 → 𝑈 ∈ 𝑀) |
mnuprss2d.3 | ⊢ (𝜑 → 𝐶 ∈ 𝑈) |
mnuprss2d.4 | ⊢ 𝐴 ⊆ 𝐶 |
mnuprss2d.5 | ⊢ 𝐵 ⊆ 𝐶 |
Ref | Expression |
---|---|
mnuprss2d | ⊢ (𝜑 → {𝐴, 𝐵} ∈ 𝑈) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mnuprss2d.1 | . 2 ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))} | |
2 | mnuprss2d.2 | . 2 ⊢ (𝜑 → 𝑈 ∈ 𝑀) | |
3 | mnuprss2d.3 | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑈) | |
4 | mnuprss2d.4 | . . 3 ⊢ 𝐴 ⊆ 𝐶 | |
5 | 4 | a1i 11 | . 2 ⊢ (𝜑 → 𝐴 ⊆ 𝐶) |
6 | mnuprss2d.5 | . . 3 ⊢ 𝐵 ⊆ 𝐶 | |
7 | 6 | a1i 11 | . 2 ⊢ (𝜑 → 𝐵 ⊆ 𝐶) |
8 | 1, 2, 3, 5, 7 | mnuprssd 40977 | 1 ⊢ (𝜑 → {𝐴, 𝐵} ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∀wal 1536 = wceq 1538 ∈ wcel 2111 {cab 2776 ∀wral 3106 ∃wrex 3107 ⊆ wss 3881 𝒫 cpw 4497 {cpr 4527 ∪ cuni 4800 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-pw 4499 df-sn 4526 df-pr 4528 df-uni 4801 |
This theorem is referenced by: mnuprdlem4 40983 |
Copyright terms: Public domain | W3C validator |