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

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

Proof of Theorem ustuqtop5
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 ustbasel 24190 . . 3 (𝑈 ∈ (UnifOn‘𝑋) → (𝑋 × 𝑋) ∈ 𝑈)
2 snssi 4717 . . . . . . . . 9 (𝑝𝑋 → {𝑝} ⊆ 𝑋)
3 dfss 3902 . . . . . . . . 9 ({𝑝} ⊆ 𝑋 ↔ {𝑝} = ({𝑝} ∩ 𝑋))
42, 3sylib 219 . . . . . . . 8 (𝑝𝑋 → {𝑝} = ({𝑝} ∩ 𝑋))
5 incom 4138 . . . . . . . 8 ({𝑝} ∩ 𝑋) = (𝑋 ∩ {𝑝})
64, 5eqtr2di 2791 . . . . . . 7 (𝑝𝑋 → (𝑋 ∩ {𝑝}) = {𝑝})
7 snnzg 4706 . . . . . . 7 (𝑝𝑋 → {𝑝} ≠ ∅)
86, 7eqnetrd 3001 . . . . . 6 (𝑝𝑋 → (𝑋 ∩ {𝑝}) ≠ ∅)
98adantl 482 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → (𝑋 ∩ {𝑝}) ≠ ∅)
10 xpima2 6135 . . . . 5 ((𝑋 ∩ {𝑝}) ≠ ∅ → ((𝑋 × 𝑋) “ {𝑝}) = 𝑋)
119, 10syl 17 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → ((𝑋 × 𝑋) “ {𝑝}) = 𝑋)
1211eqcomd 2745 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → 𝑋 = ((𝑋 × 𝑋) “ {𝑝}))
13 imaeq1 6007 . . . 4 (𝑤 = (𝑋 × 𝑋) → (𝑤 “ {𝑝}) = ((𝑋 × 𝑋) “ {𝑝}))
1413rspceeqv 3583 . . 3 (((𝑋 × 𝑋) ∈ 𝑈𝑋 = ((𝑋 × 𝑋) “ {𝑝})) → ∃𝑤𝑈 𝑋 = (𝑤 “ {𝑝}))
151, 12, 14syl2an2r 691 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → ∃𝑤𝑈 𝑋 = (𝑤 “ {𝑝}))
16 elfvex 6862 . . 3 (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
17 utopustuq.1 . . . 4 𝑁 = (𝑝𝑋 ↦ ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})))
1817ustuqtoplem 24222 . . 3 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) ∧ 𝑋 ∈ V) → (𝑋 ∈ (𝑁𝑝) ↔ ∃𝑤𝑈 𝑋 = (𝑤 “ {𝑝})))
1916, 18mpidan 695 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → (𝑋 ∈ (𝑁𝑝) ↔ ∃𝑤𝑈 𝑋 = (𝑤 “ {𝑝})))
2015, 19mpbird 258 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → 𝑋 ∈ (𝑁𝑝))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wne 2934  wrex 3063  Vcvv 3431  cin 3882  wss 3883  c0 4261  {csn 4555  cmpt 5153   × cxp 5616  ran crn 5619  cima 5621  cfv 6485  UnifOncust 24183
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 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
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 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-ust 24184
This theorem is referenced by:  ustuqtop  24229  utopsnneiplem  24230
  Copyright terms: Public domain W3C validator