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

Theorem ustinvel 23061
Description: If 𝑉 is an entourage, so is its inverse. Condition UII of [BourbakiTop1] p. II.1. (Contributed by Thierry Arnoux, 2-Dec-2017.)
Assertion
Ref Expression
ustinvel ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → 𝑉𝑈)

Proof of Theorem ustinvel
Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elfvex 6728 . . . . . . 7 (𝑈 ∈ (UnifOn‘𝑋) → 𝑋 ∈ V)
2 isust 23055 . . . . . . 7 (𝑋 ∈ V → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
31, 2syl 17 . . . . . 6 (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
43ibi 270 . . . . 5 (𝑈 ∈ (UnifOn‘𝑋) → (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣))))
54simp3d 1146 . . . 4 (𝑈 ∈ (UnifOn‘𝑋) → ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))
6 sseq1 3912 . . . . . . . 8 (𝑣 = 𝑉 → (𝑣𝑤𝑉𝑤))
76imbi1d 345 . . . . . . 7 (𝑣 = 𝑉 → ((𝑣𝑤𝑤𝑈) ↔ (𝑉𝑤𝑤𝑈)))
87ralbidv 3108 . . . . . 6 (𝑣 = 𝑉 → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ↔ ∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈)))
9 ineq1 4106 . . . . . . . 8 (𝑣 = 𝑉 → (𝑣𝑤) = (𝑉𝑤))
109eleq1d 2815 . . . . . . 7 (𝑣 = 𝑉 → ((𝑣𝑤) ∈ 𝑈 ↔ (𝑉𝑤) ∈ 𝑈))
1110ralbidv 3108 . . . . . 6 (𝑣 = 𝑉 → (∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ↔ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈))
12 sseq2 3913 . . . . . . 7 (𝑣 = 𝑉 → (( I ↾ 𝑋) ⊆ 𝑣 ↔ ( I ↾ 𝑋) ⊆ 𝑉))
13 cnveq 5727 . . . . . . . 8 (𝑣 = 𝑉𝑣 = 𝑉)
1413eleq1d 2815 . . . . . . 7 (𝑣 = 𝑉 → (𝑣𝑈𝑉𝑈))
15 sseq2 3913 . . . . . . . 8 (𝑣 = 𝑉 → ((𝑤𝑤) ⊆ 𝑣 ↔ (𝑤𝑤) ⊆ 𝑉))
1615rexbidv 3206 . . . . . . 7 (𝑣 = 𝑉 → (∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣 ↔ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))
1712, 14, 163anbi123d 1438 . . . . . 6 (𝑣 = 𝑉 → ((( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣) ↔ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉)))
188, 11, 173anbi123d 1438 . . . . 5 (𝑣 = 𝑉 → ((∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)) ↔ (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))))
1918rspcv 3522 . . . 4 (𝑉𝑈 → (∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))))
205, 19mpan9 510 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑉𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑉𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉)))
2120simp3d 1146 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → (( I ↾ 𝑋) ⊆ 𝑉𝑉𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑉))
2221simp2d 1145 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈) → 𝑉𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  w3a 1089   = wceq 1543  wcel 2112  wral 3051  wrex 3052  Vcvv 3398  cin 3852  wss 3853  𝒫 cpw 4499   I cid 5439   × cxp 5534  ccnv 5535  cres 5538  ccom 5540  cfv 6358  UnifOncust 23051
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pow 5243  ax-pr 5307  ax-un 7501
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3400  df-sbc 3684  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-br 5040  df-opab 5102  df-mpt 5121  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-res 5548  df-iota 6316  df-fun 6360  df-fv 6366  df-ust 23052
This theorem is referenced by:  ustexsym  23067  trust  23081
  Copyright terms: Public domain W3C validator