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

Theorem ustuqtop5 24564
Description: Lemma for ustuqtop 24565. (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 24526 . . 3 (𝑈 ∈ (UnifOn‘𝑋) → (𝑋 × 𝑋) ∈ 𝑈)
2 snssi 4746 . . . . . . . . 9 (𝑝 ∈ 𝑋 → {𝑝} ⊆ 𝑋)
3 dfss 3918 . . . . . . . . 9 ({𝑝} ⊆ 𝑋 ↔ {𝑝} = ({𝑝} ∩ 𝑋))
42, 3sylib 221 . . . . . . . 8 (𝑝 ∈ 𝑋 → {𝑝} = ({𝑝} ∩ 𝑋))
5 incom 4155 . . . . . . . 8 ({𝑝} ∩ 𝑋) = (𝑋 ∩ {𝑝})
64, 5eqtr2di 2813 . . . . . . 7 (𝑝 ∈ 𝑋 → (𝑋 ∩ {𝑝}) = {𝑝})
7 snnzg 4735 . . . . . . 7 (𝑝 ∈ 𝑋 → {𝑝} ≠ ∅)
86, 7eqnetrd 3023 . . . . . 6 (𝑝 ∈ 𝑋 → (𝑋 ∩ {𝑝}) ≠ ∅)
98adantl 487 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → (𝑋 ∩ {𝑝}) ≠ ∅)
10 xpima2 6176 . . . . 5 ((𝑋 ∩ {𝑝}) ≠ ∅ → ((𝑋 × 𝑋) “ {𝑝}) = 𝑋)
119, 10syl 18 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ((𝑋 × 𝑋) “ {𝑝}) = 𝑋)
1211eqcomd 2767 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → 𝑋 = ((𝑋 × 𝑋) “ {𝑝}))
13 imaeq1 6047 . . . 4 (𝑤 = (𝑋 × 𝑋) → (𝑤 “ {𝑝}) = ((𝑋 × 𝑋) “ {𝑝}))
1413rspceeqv 3599 . . 3 (((𝑋 × 𝑋) ∈ 𝑈 ∧ 𝑋 = ((𝑋 × 𝑋) “ {𝑝})) → ∃𝑤 ∈ 𝑈 𝑋 = (𝑤 “ {𝑝}))
151, 12, 14syl2an2r 698 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑝 ∈ 𝑋) → ∃𝑤 ∈ 𝑈 𝑋 = (𝑤 “ {𝑝}))
16 elfvex 6920 . . 3 (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
17 utopustuq.1 . . . 4 𝑁 = (𝑝 ∈ 𝑋 ↦ ran (𝑣 ∈ 𝑈 ↦ (𝑣 “ {𝑝})))
1817ustuqtoplem 24558 . . 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 2145   ≠ wne 2956  ∃wrex 3087  Vcvv 3451   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  {csn 4584   ↦ cmpt 5186   × cxp 5649  ran crn 5652   “ cima 5654  ‘cfv 6538  UnifOncust 24519
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ust 24520
This theorem is used by:  ustuqtop  24565  utopsnneiplem  24566
  Copyright terms: Public domain W3C validator