![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > neiptopuni | Structured version Visualization version GIF version |
Description: Lemma for neiptopreu 21345. (Contributed by Thierry Arnoux, 6-Jan-2018.) |
Ref | Expression |
---|---|
neiptop.o | ⊢ 𝐽 = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)} |
neiptop.0 | ⊢ (𝜑 → 𝑁:𝑋⟶𝒫 𝒫 𝑋) |
neiptop.1 | ⊢ ((((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ⊆ 𝑏 ∧ 𝑏 ⊆ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → 𝑏 ∈ (𝑁‘𝑝)) |
neiptop.2 | ⊢ ((𝜑 ∧ 𝑝 ∈ 𝑋) → (fi‘(𝑁‘𝑝)) ⊆ (𝑁‘𝑝)) |
neiptop.3 | ⊢ (((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → 𝑝 ∈ 𝑎) |
neiptop.4 | ⊢ (((𝜑 ∧ 𝑝 ∈ 𝑋) ∧ 𝑎 ∈ (𝑁‘𝑝)) → ∃𝑏 ∈ (𝑁‘𝑝)∀𝑞 ∈ 𝑏 𝑎 ∈ (𝑁‘𝑞)) |
neiptop.5 | ⊢ ((𝜑 ∧ 𝑝 ∈ 𝑋) → 𝑋 ∈ (𝑁‘𝑝)) |
Ref | Expression |
---|---|
neiptopuni | ⊢ (𝜑 → 𝑋 = ∪ 𝐽) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elpwi 4389 | . . . . . . . 8 ⊢ (𝑎 ∈ 𝒫 𝑋 → 𝑎 ⊆ 𝑋) | |
2 | 1 | ad2antlr 717 | . . . . . . 7 ⊢ (((𝑝 ∈ ∪ 𝐽 ∧ 𝑎 ∈ 𝒫 𝑋) ∧ 𝑝 ∈ 𝑎) → 𝑎 ⊆ 𝑋) |
3 | simpr 479 | . . . . . . 7 ⊢ (((𝑝 ∈ ∪ 𝐽 ∧ 𝑎 ∈ 𝒫 𝑋) ∧ 𝑝 ∈ 𝑎) → 𝑝 ∈ 𝑎) | |
4 | 2, 3 | sseldd 3822 | . . . . . 6 ⊢ (((𝑝 ∈ ∪ 𝐽 ∧ 𝑎 ∈ 𝒫 𝑋) ∧ 𝑝 ∈ 𝑎) → 𝑝 ∈ 𝑋) |
5 | neiptop.o | . . . . . . . . . 10 ⊢ 𝐽 = {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)} | |
6 | 5 | unieqi 4680 | . . . . . . . . 9 ⊢ ∪ 𝐽 = ∪ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)} |
7 | 6 | eleq2i 2851 | . . . . . . . 8 ⊢ (𝑝 ∈ ∪ 𝐽 ↔ 𝑝 ∈ ∪ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)}) |
8 | elunirab 4683 | . . . . . . . 8 ⊢ (𝑝 ∈ ∪ {𝑎 ∈ 𝒫 𝑋 ∣ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)} ↔ ∃𝑎 ∈ 𝒫 𝑋(𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝))) | |
9 | 7, 8 | bitri 267 | . . . . . . 7 ⊢ (𝑝 ∈ ∪ 𝐽 ↔ ∃𝑎 ∈ 𝒫 𝑋(𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝))) |
10 | simpl 476 | . . . . . . . 8 ⊢ ((𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)) → 𝑝 ∈ 𝑎) | |
11 | 10 | reximi 3192 | . . . . . . 7 ⊢ (∃𝑎 ∈ 𝒫 𝑋(𝑝 ∈ 𝑎 ∧ ∀𝑝 ∈ 𝑎 𝑎 ∈ (𝑁‘𝑝)) → ∃𝑎 ∈ 𝒫 𝑋𝑝 ∈ 𝑎) |
12 | 9, 11 | sylbi 209 | . . . . . 6 ⊢ (𝑝 ∈ ∪ 𝐽 → ∃𝑎 ∈ 𝒫 𝑋𝑝 ∈ 𝑎) |
13 | 4, 12 | r19.29a 3264 | . . . . 5 ⊢ (𝑝 ∈ ∪ 𝐽 → 𝑝 ∈ 𝑋) |
14 | 13 | a1i 11 | . . . 4 ⊢ (𝜑 → (𝑝 ∈ ∪ 𝐽 → 𝑝 ∈ 𝑋)) |
15 | 14 | ssrdv 3827 | . . 3 ⊢ (𝜑 → ∪ 𝐽 ⊆ 𝑋) |
16 | ssidd 3843 | . . . 4 ⊢ (𝜑 → 𝑋 ⊆ 𝑋) | |
17 | neiptop.5 | . . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ 𝑋) → 𝑋 ∈ (𝑁‘𝑝)) | |
18 | 17 | ralrimiva 3148 | . . . 4 ⊢ (𝜑 → ∀𝑝 ∈ 𝑋 𝑋 ∈ (𝑁‘𝑝)) |
19 | 5 | neipeltop 21341 | . . . 4 ⊢ (𝑋 ∈ 𝐽 ↔ (𝑋 ⊆ 𝑋 ∧ ∀𝑝 ∈ 𝑋 𝑋 ∈ (𝑁‘𝑝))) |
20 | 16, 18, 19 | sylanbrc 578 | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐽) |
21 | unissel 4703 | . . 3 ⊢ ((∪ 𝐽 ⊆ 𝑋 ∧ 𝑋 ∈ 𝐽) → ∪ 𝐽 = 𝑋) | |
22 | 15, 20, 21 | syl2anc 579 | . 2 ⊢ (𝜑 → ∪ 𝐽 = 𝑋) |
23 | 22 | eqcomd 2784 | 1 ⊢ (𝜑 → 𝑋 = ∪ 𝐽) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 ∧ w3a 1071 = wceq 1601 ∈ wcel 2107 ∀wral 3090 ∃wrex 3091 {crab 3094 ⊆ wss 3792 𝒫 cpw 4379 ∪ cuni 4671 ⟶wf 6131 ‘cfv 6135 ficfi 8604 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2055 ax-9 2116 ax-10 2135 ax-11 2150 ax-12 2163 ax-ext 2754 ax-nul 5025 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-clab 2764 df-cleq 2770 df-clel 2774 df-nfc 2921 df-ne 2970 df-ral 3095 df-rex 3096 df-rab 3099 df-v 3400 df-dif 3795 df-in 3799 df-ss 3806 df-nul 4142 df-pw 4381 df-uni 4672 |
This theorem is referenced by: neiptoptop 21343 neiptopnei 21344 neiptopreu 21345 |
Copyright terms: Public domain | W3C validator |