| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ustuqtop0 | Structured version Visualization version GIF version | ||
| Description: Lemma for ustuqtop 24230. (Contributed by Thierry Arnoux, 11-Jan-2018.) |
| Ref | Expression |
|---|---|
| utopustuq.1 | ⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝}))) |
| Ref | Expression |
|---|---|
| ustuqtop0 | ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑁:𝑋⟶𝒫 𝒫 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ustimasn 24212 | . . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑣 ∈ 𝑈 ∧ 𝑝 ∈ 𝑋) → (𝑣 “ {𝑝}) ⊆ 𝑋) | |
| 2 | 1 | 3expa 1124 | . . . . . . 7 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑣 ∈ 𝑈) ∧ 𝑝 ∈ 𝑋) → (𝑣 “ {𝑝}) ⊆ 𝑋) |
| 3 | 2 | an32s 658 | . . . . . 6 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑣 ∈ 𝑈) → (𝑣 “ {𝑝}) ⊆ 𝑋) |
| 4 | vex 3435 | . . . . . . . 8 ⊢ 𝑣 ∈ V | |
| 5 | 4 | imaex 7855 | . . . . . . 7 ⊢ (𝑣 “ {𝑝}) ∈ V |
| 6 | 5 | elpw 4534 | . . . . . 6 ⊢ ((𝑣 “ {𝑝}) ∈ 𝒫 𝑋 ↔ (𝑣 “ {𝑝}) ⊆ 𝑋) |
| 7 | 3, 6 | sylibr 235 | . . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑣 ∈ 𝑈) → (𝑣 “ {𝑝}) ∈ 𝒫 𝑋) |
| 8 | 7 | ralrimiva 3131 | . . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ∀𝑣 ∈ 𝑈 (𝑣 “ {𝑝}) ∈ 𝒫 𝑋) |
| 9 | eqid 2739 | . . . . 5 ⊢ (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) = (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) | |
| 10 | 9 | rnmptss 7065 | . . . 4 ⊢ (∀𝑣 ∈ 𝑈 (𝑣 “ {𝑝}) ∈ 𝒫 𝑋 → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋) |
| 11 | 8, 10 | syl 17 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋) |
| 12 | mptexg 7166 | . . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V) | |
| 13 | rnexg 7843 | . . . . 5 ⊢ ((𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V) | |
| 14 | elpwg 4533 | . . . . 5 ⊢ (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V → (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)) | |
| 15 | 12, 13, 14 | 3syl 18 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)) |
| 16 | 15 | adantr 481 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)) |
| 17 | 11, 16 | mpbird 258 | . 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋) |
| 18 | utopustuq.1 | . 2 ⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝}))) | |
| 19 | 17, 18 | fmptd 7056 | 1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑁:𝑋⟶𝒫 𝒫 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∀wral 3053 Vcvv 3431 ⊆ wss 3883 𝒫 cpw 4530 {csn 4556 ↦ cmpt 5154 ran crn 5620 “ cima 5622 ⟶wf 6482 ‘cfv 6486 UnifOncust 24184 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5200 ax-sep 5219 ax-nul 5229 ax-pow 5295 ax-pr 5363 ax-un 7679 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4263 df-if 4456 df-pw 4532 df-sn 4557 df-pr 4559 df-op 4563 df-uni 4840 df-iun 4924 df-br 5074 df-opab 5136 df-mpt 5155 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-ust 24185 |
| This theorem is referenced by: ustuqtop 24230 utopsnneiplem 24231 |
| Copyright terms: Public domain | W3C validator |