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

Theorem ustex3sym 24592
Description: In a uniform structure, for any entourage 𝑉, there exists a symmetrical entourage smaller than a third of 𝑉. (Contributed by Thierry Arnoux, 16-Jan-2018.)
Assertion
Ref Expression
ustex3sym ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → ∃𝑤 ∈ 𝑈 (◡𝑤 = 𝑤 ∧ (𝑤 ∘ (𝑤 ∘ 𝑤)) ⊆ 𝑉))
Distinct variable groups:   𝑤,𝑈   𝑤,𝑉   𝑤,𝑋

Proof of Theorem ustex3sym
Dummy variable 𝑣 is distinct from all other variables.
StepHypRef Expression
1 ustex2sym 24591 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑣 ∈ 𝑈) → ∃𝑤 ∈ 𝑈 (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣))
21ad4ant13 764 . . 3 ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) → ∃𝑤 ∈ 𝑈 (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣))
3 simprl 783 . . . . . 6 ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) ∧ 𝑤 ∈ 𝑈) ∧ (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣)) → ◡𝑤 = 𝑤)
4 simp-5l 797 . . . . . . . . 9 ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) ∧ 𝑤 ∈ 𝑈) ∧ (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣)) → 𝑈 ∈ (UnifOn‘𝑋))
5 simplr 781 . . . . . . . . 9 ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) ∧ 𝑤 ∈ 𝑈) ∧ (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣)) → 𝑤 ∈ 𝑈)
6 ustssco 24589 . . . . . . . . 9 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑤 ∈ 𝑈) → 𝑤 ⊆ (𝑤 ∘ 𝑤))
74, 5, 6syl2anc 596 . . . . . . . 8 ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) ∧ 𝑤 ∈ 𝑈) ∧ (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣)) → 𝑤 ⊆ (𝑤 ∘ 𝑤))
8 simprr 785 . . . . . . . 8 ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) ∧ 𝑤 ∈ 𝑈) ∧ (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣)) → (𝑤 ∘ 𝑤) ⊆ 𝑣)
9 coss2 5844 . . . . . . . . . 10 ((𝑤 ∘ 𝑤) ⊆ 𝑣 → (𝑤 ∘ (𝑤 ∘ 𝑤)) ⊆ (𝑤 ∘ 𝑣))
109adantl 487 . . . . . . . . 9 ((𝑤 ⊆ (𝑤 ∘ 𝑤) ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣) → (𝑤 ∘ (𝑤 ∘ 𝑤)) ⊆ (𝑤 ∘ 𝑣))
11 sstr 3921 . . . . . . . . . 10 ((𝑤 ⊆ (𝑤 ∘ 𝑤) ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣) → 𝑤 ⊆ 𝑣)
12 coss1 5843 . . . . . . . . . 10 (𝑤 ⊆ 𝑣 → (𝑤 ∘ 𝑣) ⊆ (𝑣 ∘ 𝑣))
1311, 12syl 18 . . . . . . . . 9 ((𝑤 ⊆ (𝑤 ∘ 𝑤) ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣) → (𝑤 ∘ 𝑣) ⊆ (𝑣 ∘ 𝑣))
1410, 13sstrd 3923 . . . . . . . 8 ((𝑤 ⊆ (𝑤 ∘ 𝑤) ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣) → (𝑤 ∘ (𝑤 ∘ 𝑤)) ⊆ (𝑣 ∘ 𝑣))
157, 8, 14syl2anc 596 . . . . . . 7 ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) ∧ 𝑤 ∈ 𝑈) ∧ (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣)) → (𝑤 ∘ (𝑤 ∘ 𝑤)) ⊆ (𝑣 ∘ 𝑣))
16 simpllr 788 . . . . . . 7 ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) ∧ 𝑤 ∈ 𝑈) ∧ (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣)) → (𝑣 ∘ 𝑣) ⊆ 𝑉)
1715, 16sstrd 3923 . . . . . 6 ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) ∧ 𝑤 ∈ 𝑈) ∧ (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣)) → (𝑤 ∘ (𝑤 ∘ 𝑤)) ⊆ 𝑉)
183, 17jca 521 . . . . 5 ((((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) ∧ 𝑤 ∈ 𝑈) ∧ (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣)) → (◡𝑤 = 𝑤 ∧ (𝑤 ∘ (𝑤 ∘ 𝑤)) ⊆ 𝑉))
1918ex 418 . . . 4 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) ∧ 𝑤 ∈ 𝑈) → ((◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣) → (◡𝑤 = 𝑤 ∧ (𝑤 ∘ (𝑤 ∘ 𝑤)) ⊆ 𝑉)))
2019reximdva 3179 . . 3 ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) → (∃𝑤 ∈ 𝑈 (◡𝑤 = 𝑤 ∧ (𝑤 ∘ 𝑤) ⊆ 𝑣) → ∃𝑤 ∈ 𝑈 (◡𝑤 = 𝑤 ∧ (𝑤 ∘ (𝑤 ∘ 𝑤)) ⊆ 𝑉)))
212, 20mpd 16 . 2 ((((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) ∧ 𝑣 ∈ 𝑈) ∧ (𝑣 ∘ 𝑣) ⊆ 𝑉) → ∃𝑤 ∈ 𝑈 (◡𝑤 = 𝑤 ∧ (𝑤 ∘ (𝑤 ∘ 𝑤)) ⊆ 𝑉))
22 ustexhalf 24585 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → ∃𝑣 ∈ 𝑈 (𝑣 ∘ 𝑣) ⊆ 𝑉)
2321, 22r19.29a 3174 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉 ∈ 𝑈) → ∃𝑤 ∈ 𝑈 (◡𝑤 = 𝑤 ∧ (𝑤 ∘ (𝑤 ∘ 𝑤)) ⊆ 𝑉))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900  ◡ccnv 5657   ∘ ccom 5662  ‘cfv 6566  UnifOncust 24574
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-iota 6520  df-fun 6568  df-fv 6574  df-ust 24575
This theorem is used by:  utopreg  24626
  Copyright terms: Public domain W3C validator