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

Theorem ustuqtop0 24218
Description: Lemma for ustuqtop 24224. (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 24206 . . . . . . . 8 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑣𝑈𝑝𝑋) → (𝑣 “ {𝑝}) ⊆ 𝑋)
213expa 1119 . . . . . . 7 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑣𝑈) ∧ 𝑝𝑋) → (𝑣 “ {𝑝}) ⊆ 𝑋)
32an32s 653 . . . . . 6 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) ∧ 𝑣𝑈) → (𝑣 “ {𝑝}) ⊆ 𝑋)
4 vex 3434 . . . . . . . 8 𝑣 ∈ V
54imaex 7859 . . . . . . 7 (𝑣 “ {𝑝}) ∈ V
65elpw 4546 . . . . . 6 ((𝑣 “ {𝑝}) ∈ 𝒫 𝑋 ↔ (𝑣 “ {𝑝}) ⊆ 𝑋)
73, 6sylibr 234 . . . . 5 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) ∧ 𝑣𝑈) → (𝑣 “ {𝑝}) ∈ 𝒫 𝑋)
87ralrimiva 3130 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → ∀𝑣𝑈 (𝑣 “ {𝑝}) ∈ 𝒫 𝑋)
9 eqid 2737 . . . . 5 (𝑣𝑈 ↦ (𝑣 “ {𝑝})) = (𝑣𝑈 ↦ (𝑣 “ {𝑝}))
109rnmptss 7070 . . . 4 (∀𝑣𝑈 (𝑣 “ {𝑝}) ∈ 𝒫 𝑋 → ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)
118, 10syl 17 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋)
12 mptexg 7170 . . . . 5 (𝑈 ∈ (UnifOn‘𝑋) → (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ V)
13 rnexg 7847 . . . . 5 ((𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ V → ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ V)
14 elpwg 4545 . . . . 5 (ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ V → (ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋))
1512, 13, 143syl 18 . . . 4 (𝑈 ∈ (UnifOn‘𝑋) → (ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋))
1615adantr 480 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → (ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋 ↔ ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ⊆ 𝒫 𝑋))
1711, 16mpbird 257 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})) ∈ 𝒫 𝒫 𝑋)
18 utopustuq.1 . 2 𝑁 = (𝑝𝑋 ↦ ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})))
1917, 18fmptd 7061 1 (𝑈 ∈ (UnifOn‘𝑋) → 𝑁:𝑋⟶𝒫 𝒫 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  wral 3052  Vcvv 3430  wss 3890  𝒫 cpw 4542  {csn 4568  cmpt 5167  ran crn 5626  cima 5628  wf 6489  cfv 6493  UnifOncust 24178
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 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ust 24179
This theorem is referenced by:  ustuqtop  24224  utopsnneiplem  24225
  Copyright terms: Public domain W3C validator