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

Theorem ustuqtop5 24432
Description: Lemma for ustuqtop 24433. (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 24394 . . 3 (𝑈 ∈ (UnifOn‘𝑋) → (𝑋 × 𝑋) ∈ 𝑈)
2 snssi 4756 . . . . . . . . 9 (𝑝𝑋 → {𝑝} ⊆ 𝑋)
3 dfss 3927 . . . . . . . . 9 ({𝑝} ⊆ 𝑋 ↔ {𝑝} = ({𝑝} ∩ 𝑋))
42, 3sylib 221 . . . . . . . 8 (𝑝𝑋 → {𝑝} = ({𝑝} ∩ 𝑋))
5 incom 4165 . . . . . . . 8 ({𝑝} ∩ 𝑋) = (𝑋 ∩ {𝑝})
64, 5eqtr2di 2818 . . . . . . 7 (𝑝𝑋 → (𝑋 ∩ {𝑝}) = {𝑝})
7 snnzg 4745 . . . . . . 7 (𝑝𝑋 → {𝑝} ≠ ∅)
86, 7eqnetrd 3028 . . . . . 6 (𝑝𝑋 → (𝑋 ∩ {𝑝}) ≠ ∅)
98adantl 487 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → (𝑋 ∩ {𝑝}) ≠ ∅)
10 xpima2 6187 . . . . 5 ((𝑋 ∩ {𝑝}) ≠ ∅ → ((𝑋 × 𝑋) “ {𝑝}) = 𝑋)
119, 10syl 18 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → ((𝑋 × 𝑋) “ {𝑝}) = 𝑋)
1211eqcomd 2772 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → 𝑋 = ((𝑋 × 𝑋) “ {𝑝}))
13 imaeq1 6062 . . . 4 (𝑤 = (𝑋 × 𝑋) → (𝑤 “ {𝑝}) = ((𝑋 × 𝑋) “ {𝑝}))
1413rspceeqv 3607 . . 3 (((𝑋 × 𝑋) ∈ 𝑈𝑋 = ((𝑋 × 𝑋) “ {𝑝})) → ∃𝑤𝑈 𝑋 = (𝑤 “ {𝑝}))
151, 12, 14syl2an2r 698 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → ∃𝑤𝑈 𝑋 = (𝑤 “ {𝑝}))
16 elfvex 6923 . . 3 (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
17 utopustuq.1 . . . 4 𝑁 = (𝑝𝑋 ↦ ran (𝑣𝑈 ↦ (𝑣 “ {𝑝})))
1817ustuqtoplem 24426 . . 3 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) ∧ 𝑋 ∈ V) → (𝑋 ∈ (𝑁𝑝) ↔ ∃𝑤𝑈 𝑋 = (𝑤 “ {𝑝})))
1916, 18mpidan 702 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → (𝑋 ∈ (𝑁𝑝) ↔ ∃𝑤𝑈 𝑋 = (𝑤 “ {𝑝})))
2015, 19mpbird 260 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝𝑋) → 𝑋 ∈ (𝑁𝑝))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wne 2961  wrex 3092  Vcvv 3458  cin 3907  wss 3908  c0 4289  {csn 4594  cmpt 5197   × cxp 5664  ran crn 5667  cima 5669  cfv 6543  UnifOncust 24387
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ust 24388
This theorem is used by:  ustuqtop  24433  utopsnneiplem  24434
  Copyright terms: Public domain W3C validator