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

Theorem ustssco 24383
Description: In an uniform structure, any entourage 𝑉 is a subset of its composition with itself. (Contributed by Thierry Arnoux, 5-Jan-2018.)
Assertion
Ref Expression
ustssco ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → 𝑉 ⊆ (𝑉𝑉))

Proof of Theorem ustssco
StepHypRef Expression
1 ssun1 4130 . . . 4 𝑉 ⊆ (𝑉 ∪ (𝑉𝑉))
2 coires1 6265 . . . . . 6 (𝑉 ∘ ( I ↾ 𝑋)) = (𝑉𝑋)
3 ustrel 24380 . . . . . . 7 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → Rel 𝑉)
4 ustssxp 24373 . . . . . . . . 9 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → 𝑉 ⊆ (𝑋 × 𝑋))
5 dmss 5891 . . . . . . . . 9 (𝑉 ⊆ (𝑋 × 𝑋) → dom 𝑉 ⊆ dom (𝑋 × 𝑋))
64, 5syl 18 . . . . . . . 8 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → dom 𝑉 ⊆ dom (𝑋 × 𝑋))
7 dmxpid 5919 . . . . . . . 8 dom (𝑋 × 𝑋) = 𝑋
86, 7sseqtrdi 3976 . . . . . . 7 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → dom 𝑉𝑋)
9 relssres 6020 . . . . . . 7 ((Rel 𝑉 ∧ dom 𝑉𝑋) → (𝑉𝑋) = 𝑉)
103, 8, 9syl2anc 595 . . . . . 6 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → (𝑉𝑋) = 𝑉)
112, 10eqtrid 2809 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → (𝑉 ∘ ( I ↾ 𝑋)) = 𝑉)
1211uneq1d 4120 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → ((𝑉 ∘ ( I ↾ 𝑋)) ∪ (𝑉𝑉)) = (𝑉 ∪ (𝑉𝑉)))
131, 12sseqtrrid 3979 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → 𝑉 ⊆ ((𝑉 ∘ ( I ↾ 𝑋)) ∪ (𝑉𝑉)))
14 coundi 6247 . . 3 (𝑉 ∘ (( I ↾ 𝑋) ∪ 𝑉)) = ((𝑉 ∘ ( I ↾ 𝑋)) ∪ (𝑉𝑉))
1513, 14sseqtrrdi 3977 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → 𝑉 ⊆ (𝑉 ∘ (( I ↾ 𝑋) ∪ 𝑉)))
16 ustdiag 24377 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → ( I ↾ 𝑋) ⊆ 𝑉)
17 ssequn1 4138 . . . 4 (( I ↾ 𝑋) ⊆ 𝑉 ↔ (( I ↾ 𝑋) ∪ 𝑉) = 𝑉)
1816, 17sylib 221 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → (( I ↾ 𝑋) ∪ 𝑉) = 𝑉)
1918coeq2d 5847 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → (𝑉 ∘ (( I ↾ 𝑋) ∪ 𝑉)) = (𝑉𝑉))
2015, 19sseqtrd 3972 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → 𝑉 ⊆ (𝑉𝑉))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 400   = wceq 1569  wcel 2142  cun 3902  wss 3904   I cid 5554   × cxp 5658  dom cdm 5660  cres 5662  ccom 5664  Rel wrel 5665  cfv 6536  UnifOncust 24368
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-iota 6492  df-fun 6538  df-fv 6544  df-ust 24369
This theorem is used by:  ustexsym  24384  ustex3sym  24386
  Copyright terms: Public domain W3C validator