| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ustuqtop0 | Structured version Visualization version GIF version | ||
| Description: Lemma for ustuqtop 24211. (Contributed by Thierry Arnoux, 11-Jan-2018.) |
| Ref | Expression |
|---|---|
| utopustuq.1 | ⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝}))) |
| Ref | Expression |
|---|---|
| ustuqtop0 | ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑁:𝑋⟶𝒫 𝒫 𝑋) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ustimasn 24193 | . . . . . . . 8 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑣 ∈ 𝑈 ∧ 𝑝 ∈ 𝑋) → (𝑣 “ {𝑝}) ⊆ 𝑋) | |
| 2 | 1 | 3expa 1119 | . . . . . . 7 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑣 ∈ 𝑈) ∧ 𝑝 ∈ 𝑋) → (𝑣 “ {𝑝}) ⊆ 𝑋) |
| 3 | 2 | an32s 653 | . . . . . 6 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑣 ∈ 𝑈) → (𝑣 “ {𝑝}) ⊆ 𝑋) |
| 4 | vex 3433 | . . . . . . . 8 ⊢ 𝑣 ∈ V | |
| 5 | 4 | imaex 7865 | . . . . . . 7 ⊢ (𝑣 “ {𝑝}) ∈ V |
| 6 | 5 | elpw 4545 | . . . . . 6 ⊢ ((𝑣 “ {𝑝}) ∈ 𝒫 𝑋 ↔ (𝑣 “ {𝑝}) ⊆ 𝑋) |
| 7 | 3, 6 | sylibr 234 | . . . . 5 ⊢ (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) ∧ 𝑣 ∈ 𝑈) → (𝑣 “ {𝑝}) ∈ 𝒫 𝑋) |
| 8 | 7 | ralrimiva 3129 | . . . 4 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ∀𝑣 ∈ 𝑈 (𝑣 “ {𝑝}) ∈ 𝒫 𝑋) |
| 9 | eqid 2736 | . . . . 5 ⊢ (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) = (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) | |
| 10 | 9 | rnmptss 7075 | . . . 4 ⊢ (∀𝑣 ∈ 𝑈 (𝑣 “ {𝑝}) ∈ 𝒫 𝑋 → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋) |
| 11 | 8, 10 | syl 17 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋) |
| 12 | mptexg 7176 | . . . . 5 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V) | |
| 13 | rnexg 7853 | . . . . 5 ⊢ ((𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V) | |
| 14 | elpwg 4544 | . . . . 5 ⊢ (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ V → (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)) | |
| 15 | 12, 13, 14 | 3syl 18 | . . . 4 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)) |
| 16 | 15 | adantr 480 | . . 3 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)) |
| 17 | 11, 16 | mpbird 257 | . 2 ⊢ ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋) |
| 18 | utopustuq.1 | . 2 ⊢ 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝}))) | |
| 19 | 17, 18 | fmptd 7066 | 1 ⊢ (𝑈 ∈ (UnifOn‘𝑋) → 𝑁:𝑋⟶𝒫 𝒫 𝑋) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3051 Vcvv 3429 ⊆ wss 3889 𝒫 cpw 4541 {csn 4567 ↦ cmpt 5166 ran crn 5632 “ cima 5634 ⟶wf 6494 ‘cfv 6498 UnifOncust 24165 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ust 24166 |
| This theorem is referenced by: ustuqtop 24211 utopsnneiplem 24212 |
| Copyright terms: Public domain | W3C validator |