| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ustuqtop0 | Structured version Visualization version GIF version | ||
| Description: Lemma for ustuqtop 24622. (Contributed by Thierry Arnoux, 11-Jan-2018.) |
| Ref | Expression |
|---|---|
| utopustuq.1 | ⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝}))) |
| Ref | Expression |
|---|---|
| ustuqtop0 | ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑁:𝑋⟶𝒫 𝒫 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ustimasn 24604 | . . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑣 ∈ 𝑈 ∧ 𝑝 ∈ 𝑋) → (𝑣 “ {𝑝}) ⊆ 𝑋) | |
| 2 | 1 | 3expa 1137 | . . . . . . 7 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑣 ∈ 𝑈) ∧ 𝑝 ∈ 𝑋) → (𝑣 “ {𝑝}) ⊆ 𝑋) |
| 3 | 2 | an32s 665 | . . . . . 6 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑣 ∈ 𝑈) → (𝑣 “ {𝑝}) ⊆ 𝑋) |
| 4 | vex 3457 | . . . . . . . 8 ⊢ 𝑣 ∈ V | |
| 5 | 4 | imaex 7959 | . . . . . . 7 ⊢ (𝑣 “ {𝑝}) ∈ V |
| 6 | 5 | elpw 4563 | . . . . . 6 ⊢ ((𝑣 “ {𝑝}) ∈ 𝒫 𝑋 ↔ (𝑣 “ {𝑝}) ⊆ 𝑋) |
| 7 | 3, 6 | sylibr 237 | . . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑣 ∈ 𝑈) → (𝑣 “ {𝑝}) ∈ 𝒫 𝑋) |
| 8 | 7 | ralrimiva 3161 | . . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ∀𝑣 ∈ 𝑈 (𝑣 “ {𝑝}) ∈ 𝒫 𝑋) |
| 9 | eqid 2766 | . . . . 5 ⊢ (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) = (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) | |
| 10 | 9 | rnmptss 7154 | . . . 4 ⊢ (∀𝑣 ∈ 𝑈 (𝑣 “ {𝑝}) ∈ 𝒫 𝑋 → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋) |
| 11 | 8, 10 | syl 18 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋) |
| 12 | mptexg 7257 | . . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V) | |
| 13 | rnexg 7947 | . . . . 5 ⊢ ((𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V) | |
| 14 | elpwg 4562 | . . . . 5 ⊢ (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V → (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)) | |
| 15 | 12, 13, 14 | 3syl 19 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)) |
| 16 | 15 | adantr 486 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)) |
| 17 | 11, 16 | mpbird 260 | . 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋) |
| 18 | utopustuq.1 | . 2 ⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝}))) | |
| 19 | 17, 18 | fmptd 7145 | 1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑁:𝑋⟶𝒫 𝒫 𝑋) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1572 ∈ wcel 2150 ∀wral 3083 Vcvv 3453 ⊆ wss 3899 𝒫 cpw 4559 {csn 4587 ↦ cmpt 5191 ran crn 5658 “ cima 5660 ⟶wf 6561 ‘cfv 6565 UnifOncust 24576 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-ust 24577 |
| This theorem is used by: ustuqtop 24622 utopsnneiplem 24623 |
| Copyright terms: Public domain | W3C validator |