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

Theorem ustneism 24381
Description: For a point 𝐴 in 𝑋, (𝑉 “ {𝐴}) is small enough in (𝑉𝑉). This proposition actually does not require any axiom of the definition of uniform structures. (Contributed by Thierry Arnoux, 18-Nov-2017.)
Assertion
Ref Expression
ustneism ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴𝑋) → ((𝑉 “ {𝐴}) × (𝑉 “ {𝐴})) ⊆ (𝑉𝑉))

Proof of Theorem ustneism
StepHypRef Expression
1 snnzg 4740 . . . 4 (𝐴𝑋 → {𝐴} ≠ ∅)
21adantl 486 . . 3 ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴𝑋) → {𝐴} ≠ ∅)
3 xpco 6290 . . 3 ({𝐴} ≠ ∅ → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) = ((𝑉 “ {𝐴}) × (𝑉 “ {𝐴})))
42, 3syl 18 . 2 ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) = ((𝑉 “ {𝐴}) × (𝑉 “ {𝐴})))
5 cnvxp 6154 . . . . 5 ({𝐴} × (𝑉 “ {𝐴})) = ((𝑉 “ {𝐴}) × {𝐴})
6 ressn 6286 . . . . . . 7 (𝑉 ↾ {𝐴}) = ({𝐴} × (𝑉 “ {𝐴}))
76cnveqi 5860 . . . . . 6 (𝑉 ↾ {𝐴}) = ({𝐴} × (𝑉 “ {𝐴}))
8 resss 6000 . . . . . . 7 (𝑉 ↾ {𝐴}) ⊆ 𝑉
9 cnvss 5858 . . . . . . 7 ((𝑉 ↾ {𝐴}) ⊆ 𝑉(𝑉 ↾ {𝐴}) ⊆ 𝑉)
108, 9ax-mp 5 . . . . . 6 (𝑉 ↾ {𝐴}) ⊆ 𝑉
117, 10eqsstrri 3984 . . . . 5 ({𝐴} × (𝑉 “ {𝐴})) ⊆ 𝑉
125, 11eqsstrri 3984 . . . 4 ((𝑉 “ {𝐴}) × {𝐴}) ⊆ 𝑉
13 coss2 5842 . . . 4 (((𝑉 “ {𝐴}) × {𝐴}) ⊆ 𝑉 → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) ⊆ (({𝐴} × (𝑉 “ {𝐴})) ∘ 𝑉))
1412, 13mp1i 14 . . 3 ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) ⊆ (({𝐴} × (𝑉 “ {𝐴})) ∘ 𝑉))
156, 8eqsstrri 3984 . . . 4 ({𝐴} × (𝑉 “ {𝐴})) ⊆ 𝑉
16 coss1 5841 . . . 4 (({𝐴} × (𝑉 “ {𝐴})) ⊆ 𝑉 → (({𝐴} × (𝑉 “ {𝐴})) ∘ 𝑉) ⊆ (𝑉𝑉))
1715, 16mp1i 14 . . 3 ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ 𝑉) ⊆ (𝑉𝑉))
1814, 17sstrd 3947 . 2 ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) ⊆ (𝑉𝑉))
194, 18eqsstrrd 3972 1 ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴𝑋) → ((𝑉 “ {𝐴}) × (𝑉 “ {𝐴})) ⊆ (𝑉𝑉))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  wne 2958  wss 3905  c0 4286  {csn 4589   × cxp 5659  ccnv 5660  cres 5663  cima 5664  ccom 5665
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-11 2192  ax-ext 2735  ax-sep 5257  ax-pr 5404
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-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674
This theorem is referenced by:  neipcfilu  24452
  Copyright terms: Public domain W3C validator