Theorem ustneism 24411

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

Step	Hyp	Ref	Expression
1		snnzg 4745	. . . 4 ⊢ (𝐴 ∈ 𝑋 → {𝐴} ≠ ∅)
2	1	adantl 487	. . 3 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → {𝐴} ≠ ∅)
3		xpco 6297	. . 3 ⊢ ({𝐴} ≠ ∅ → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) = ((𝑉 “ {𝐴}) × (𝑉 “ {𝐴})))
4	2, 3	syl 18	. 2 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) = ((𝑉 “ {𝐴}) × (𝑉 “ {𝐴})))
5		cnvxp 6159	. . . . 5 ⊢ ◡({𝐴} × (𝑉 “ {𝐴})) = ((𝑉 “ {𝐴}) × {𝐴})
6		ressn 6293	. . . . . . 7 ⊢ (𝑉 ↾ {𝐴}) = ({𝐴} × (𝑉 “ {𝐴}))
7	6	cnveqi 5865	. . . . . 6 ⊢ ◡(𝑉 ↾ {𝐴}) = ◡({𝐴} × (𝑉 “ {𝐴}))
8		resss 6005	. . . . . . 7 ⊢ (𝑉 ↾ {𝐴}) ⊆ 𝑉
9		cnvss 5863	. . . . . . 7 ⊢ ((𝑉 ↾ {𝐴}) ⊆ 𝑉 → ◡(𝑉 ↾ {𝐴}) ⊆ ◡𝑉)
10	8, 9	ax-mp 5	. . . . . 6 ⊢ ◡(𝑉 ↾ {𝐴}) ⊆ ◡𝑉
11	7, 10	eqsstrri 3987	. . . . 5 ⊢ ◡({𝐴} × (𝑉 “ {𝐴})) ⊆ ◡𝑉
12	5, 11	eqsstrri 3987	. . . 4 ⊢ ((𝑉 “ {𝐴}) × {𝐴}) ⊆ ◡𝑉
13		coss2 5847	. . . 4 ⊢ (((𝑉 “ {𝐴}) × {𝐴}) ⊆ ◡𝑉 → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) ⊆ (({𝐴} × (𝑉 “ {𝐴})) ∘ ◡𝑉))
14	12, 13	mp1i 14	. . 3 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) ⊆ (({𝐴} × (𝑉 “ {𝐴})) ∘ ◡𝑉))
15	6, 8	eqsstrri 3987	. . . 4 ⊢ ({𝐴} × (𝑉 “ {𝐴})) ⊆ 𝑉
16		coss1 5846	. . . 4 ⊢ (({𝐴} × (𝑉 “ {𝐴})) ⊆ 𝑉 → (({𝐴} × (𝑉 “ {𝐴})) ∘ ◡𝑉) ⊆ (𝑉 ∘ ◡𝑉))
17	15, 16	mp1i 14	. . 3 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ ◡𝑉) ⊆ (𝑉 ∘ ◡𝑉))
18	14, 17	sstrd 3950	. 2 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → (({𝐴} × (𝑉 “ {𝐴})) ∘ ((𝑉 “ {𝐴}) × {𝐴})) ⊆ (𝑉 ∘ ◡𝑉))
19	4, 18	eqsstrrd 3975	1 ⊢ ((𝑉 ⊆ (𝑋 × 𝑋) ∧ 𝐴 ∈ 𝑋) → ((𝑉 “ {𝐴}) × (𝑉 “ {𝐴})) ⊆ (𝑉 ∘ ◡𝑉))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146   ≠ wne 2961   ⊆ wss 3908  ∅c0 4289  {csn 4594   × cxp 5664  ^◡ccnv 5665   ↾ cres 5668   “ cima 5669   ∘ ccom 5670

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-11 2195  ax-ext 2738  ax-sep 5262  ax-pr 5409

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-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679

This theorem is used by:  neipcfilu  24482