MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ustuqtop0 Structured version   Visualization version   GIF version

Theorem ustuqtop0 24397
Description: Lemma for ustuqtop 24403. (Contributed by Thierry Arnoux, 11-Jan-2018.)
Hypothesis
Ref Expression
utopustuq.1 𝑁 = (𝑝𝑋 ↦ ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})))
Assertion
Ref Expression
ustuqtop0 (𝑈 ∈ (UnifOn‘𝑋) → 𝑁:𝑋⟶𝒫 𝒫 𝑋)
Distinct variable groups:   𝑣,𝑝,𝑈   𝑋,𝑝,𝑣   𝑁,𝑝
Allowed substitution hint:   𝑁(𝑣)

Proof of Theorem ustuqtop0
StepHypRef Expression
1 ustimasn 24385 . . . . . . . 8 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑣𝑈𝑝𝑋) → (𝑣 “ {𝑝}) ⊆ 𝑋)
213expa 1136 . . . . . . 7 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑣𝑈) ∧ 𝑝𝑋) → (𝑣 “ {𝑝}) ⊆ 𝑋)
32an32s 664 . . . . . 6 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) ∧ 𝑣𝑈) → (𝑣 “ {𝑝}) ⊆ 𝑋)
4 vex 3459 . . . . . . . 8 𝑣 ∈ V
54imaex 7907 . . . . . . 7 (𝑣 “ {𝑝}) ∈ V
65elpw 4566 . . . . . 6 ((𝑣 “ {𝑝}) ∈ 𝒫 𝑋 ↔ (𝑣 “ {𝑝}) ⊆ 𝑋)
73, 6sylibr 237 . . . . 5 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) ∧ 𝑣𝑈) → (𝑣 “ {𝑝}) ∈ 𝒫 𝑋)
87ralrimiva 3157 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → ∀𝑣𝑈 (𝑣 “ {𝑝}) ∈ 𝒫 𝑋)
9 eqid 2763 . . . . 5 (𝑣𝑈 ↦ (𝑣 “ {𝑝})) = (𝑣𝑈 ↦ (𝑣 “ {𝑝}))
109rnmptss 7118 . . . 4 (∀𝑣𝑈 (𝑣 “ {𝑝}) ∈ 𝒫 𝑋 → ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)
118, 10syl 18 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)
12 mptexg 7219 . . . . 5 (𝑈 ∈ (UnifOn‘𝑋) → (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ V)
13 rnexg 7895 . . . . 5 ((𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ V → ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ V)
14 elpwg 4565 . . . . 5 (ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ V → (ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋))
1512, 13, 143syl 19 . . . 4 (𝑈 ∈ (UnifOn‘𝑋) → (ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋))
1615adantr 485 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → (ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋))
1711, 16mpbird 260 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋)
18 utopustuq.1 . 2 𝑁 = (𝑝𝑋 ↦ ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})))
1917, 18fmptd 7109 1 (𝑈 ∈ (UnifOn‘𝑋) → 𝑁:𝑋⟶𝒫 𝒫 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400   = wceq 1570  wcel 2143  wral 3079  Vcvv 3455  wss 3905  𝒫 cpw 4562  {csn 4589  cmpt 5192  ran crn 5662  cima 5664  wf 6532  cfv 6536  UnifOncust 24357
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ust 24358
This theorem is referenced by:  ustuqtop  24403  utopsnneiplem  24404
  Copyright terms: Public domain W3C validator