![]() |
Mathbox for Rohan Ridenour |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > mnuss2d | Structured version Visualization version GIF version |
Description: mnussd 40971 with arguments provided with an existential quantifier. (Contributed by Rohan Ridenour, 13-Aug-2023.) |
Ref | Expression |
---|---|
mnuss2d.1 | ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))} |
mnuss2d.2 | ⊢ (𝜑 → 𝑈 ∈ 𝑀) |
mnuss2d.3 | ⊢ (𝜑 → ∃𝑥 ∈ 𝑈 𝐴 ⊆ 𝑥) |
Ref | Expression |
---|---|
mnuss2d | ⊢ (𝜑 → 𝐴 ∈ 𝑈) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mnuss2d.3 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝑈 𝐴 ⊆ 𝑥) | |
2 | mnuss2d.1 | . . 3 ⊢ 𝑀 = {𝑘 ∣ ∀𝑙 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑘 ∧ ∀𝑚∃𝑛 ∈ 𝑘 (𝒫 𝑙 ⊆ 𝑛 ∧ ∀𝑝 ∈ 𝑙 (∃𝑞 ∈ 𝑘 (𝑝 ∈ 𝑞 ∧ 𝑞 ∈ 𝑚) → ∃𝑟 ∈ 𝑚 (𝑝 ∈ 𝑟 ∧ ∪ 𝑟 ⊆ 𝑛))))} | |
3 | mnuss2d.2 | . . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑀) | |
4 | 3 | adantr 484 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝐴 ⊆ 𝑥)) → 𝑈 ∈ 𝑀) |
5 | simprl 770 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝐴 ⊆ 𝑥)) → 𝑥 ∈ 𝑈) | |
6 | simprr 772 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝐴 ⊆ 𝑥)) → 𝐴 ⊆ 𝑥) | |
7 | 2, 4, 5, 6 | mnussd 40971 | . 2 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑈 ∧ 𝐴 ⊆ 𝑥)) → 𝐴 ∈ 𝑈) |
8 | 1, 7 | rexlimddv 3250 | 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 ∪ 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 |
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-in 3888 df-ss 3898 df-pw 4499 df-uni 4801 |
This theorem is referenced by: mnupwd 40975 mnuunid 40985 mnurndlem2 40990 |
Copyright terms: Public domain | W3C validator |