MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ustexhalf Structured version   Unicode version

Theorem ustexhalf 18245
Description: For each entourage  V there is an entourage  w that is "not more than half as large". Condition UIII of [BourbakiTop1] p. II.1. (Contributed by Thierry Arnoux, 2-Dec-2017.)
Assertion
Ref Expression
ustexhalf  |-  ( ( U  e.  (UnifOn `  X )  /\  V  e.  U )  ->  E. w  e.  U  ( w  o.  w )  C_  V
)
Distinct variable groups:    w, U    w, X    w, V

Proof of Theorem ustexhalf
Dummy variable  v is distinct from all other variables.
StepHypRef Expression
1 elfvex 5761 . . . . . . 7  |-  ( U  e.  (UnifOn `  X
)  ->  X  e.  _V )
2 isust 18238 . . . . . . 7  |-  ( X  e.  _V  ->  ( U  e.  (UnifOn `  X
)  <->  ( U  C_  ~P ( X  X.  X
)  /\  ( X  X.  X )  e.  U  /\  A. v  e.  U  ( A. w  e.  ~P  ( X  X.  X
) ( v  C_  w  ->  w  e.  U
)  /\  A. w  e.  U  ( v  i^i  w )  e.  U  /\  ( (  _I  |`  X ) 
C_  v  /\  `' v  e.  U  /\  E. w  e.  U  ( w  o.  w ) 
C_  v ) ) ) ) )
31, 2syl 16 . . . . . 6  |-  ( U  e.  (UnifOn `  X
)  ->  ( U  e.  (UnifOn `  X )  <->  ( U  C_  ~P ( X  X.  X )  /\  ( X  X.  X
)  e.  U  /\  A. v  e.  U  ( A. w  e.  ~P  ( X  X.  X
) ( v  C_  w  ->  w  e.  U
)  /\  A. w  e.  U  ( v  i^i  w )  e.  U  /\  ( (  _I  |`  X ) 
C_  v  /\  `' v  e.  U  /\  E. w  e.  U  ( w  o.  w ) 
C_  v ) ) ) ) )
43ibi 234 . . . . 5  |-  ( U  e.  (UnifOn `  X
)  ->  ( U  C_ 
~P ( X  X.  X )  /\  ( X  X.  X )  e.  U  /\  A. v  e.  U  ( A. w  e.  ~P  ( X  X.  X ) ( v  C_  w  ->  w  e.  U )  /\  A. w  e.  U  ( v  i^i  w )  e.  U  /\  (
(  _I  |`  X ) 
C_  v  /\  `' v  e.  U  /\  E. w  e.  U  ( w  o.  w ) 
C_  v ) ) ) )
54simp3d 972 . . . 4  |-  ( U  e.  (UnifOn `  X
)  ->  A. v  e.  U  ( A. w  e.  ~P  ( X  X.  X ) ( v  C_  w  ->  w  e.  U )  /\  A. w  e.  U  ( v  i^i  w )  e.  U  /\  (
(  _I  |`  X ) 
C_  v  /\  `' v  e.  U  /\  E. w  e.  U  ( w  o.  w ) 
C_  v ) ) )
6 sseq1 3371 . . . . . . . 8  |-  ( v  =  V  ->  (
v  C_  w  <->  V  C_  w
) )
76imbi1d 310 . . . . . . 7  |-  ( v  =  V  ->  (
( v  C_  w  ->  w  e.  U )  <-> 
( V  C_  w  ->  w  e.  U ) ) )
87ralbidv 2727 . . . . . 6  |-  ( v  =  V  ->  ( A. w  e.  ~P  ( X  X.  X
) ( v  C_  w  ->  w  e.  U
)  <->  A. w  e.  ~P  ( X  X.  X
) ( V  C_  w  ->  w  e.  U
) ) )
9 ineq1 3537 . . . . . . . 8  |-  ( v  =  V  ->  (
v  i^i  w )  =  ( V  i^i  w ) )
109eleq1d 2504 . . . . . . 7  |-  ( v  =  V  ->  (
( v  i^i  w
)  e.  U  <->  ( V  i^i  w )  e.  U
) )
1110ralbidv 2727 . . . . . 6  |-  ( v  =  V  ->  ( A. w  e.  U  ( v  i^i  w
)  e.  U  <->  A. w  e.  U  ( V  i^i  w )  e.  U
) )
12 sseq2 3372 . . . . . . 7  |-  ( v  =  V  ->  (
(  _I  |`  X ) 
C_  v  <->  (  _I  |`  X )  C_  V
) )
13 cnveq 5049 . . . . . . . 8  |-  ( v  =  V  ->  `' v  =  `' V
)
1413eleq1d 2504 . . . . . . 7  |-  ( v  =  V  ->  ( `' v  e.  U  <->  `' V  e.  U ) )
15 sseq2 3372 . . . . . . . 8  |-  ( v  =  V  ->  (
( w  o.  w
)  C_  v  <->  ( w  o.  w )  C_  V
) )
1615rexbidv 2728 . . . . . . 7  |-  ( v  =  V  ->  ( E. w  e.  U  ( w  o.  w
)  C_  v  <->  E. w  e.  U  ( w  o.  w )  C_  V
) )
1712, 14, 163anbi123d 1255 . . . . . 6  |-  ( v  =  V  ->  (
( (  _I  |`  X ) 
C_  v  /\  `' v  e.  U  /\  E. w  e.  U  ( w  o.  w ) 
C_  v )  <->  ( (  _I  |`  X )  C_  V  /\  `' V  e.  U  /\  E. w  e.  U  ( w  o.  w )  C_  V
) ) )
188, 11, 173anbi123d 1255 . . . . 5  |-  ( v  =  V  ->  (
( A. w  e. 
~P  ( X  X.  X ) ( v 
C_  w  ->  w  e.  U )  /\  A. w  e.  U  (
v  i^i  w )  e.  U  /\  (
(  _I  |`  X ) 
C_  v  /\  `' v  e.  U  /\  E. w  e.  U  ( w  o.  w ) 
C_  v ) )  <-> 
( A. w  e. 
~P  ( X  X.  X ) ( V 
C_  w  ->  w  e.  U )  /\  A. w  e.  U  ( V  i^i  w )  e.  U  /\  ( (  _I  |`  X )  C_  V  /\  `' V  e.  U  /\  E. w  e.  U  ( w  o.  w )  C_  V
) ) ) )
1918rspcv 3050 . . . 4  |-  ( V  e.  U  ->  ( A. v  e.  U  ( A. w  e.  ~P  ( X  X.  X
) ( v  C_  w  ->  w  e.  U
)  /\  A. w  e.  U  ( v  i^i  w )  e.  U  /\  ( (  _I  |`  X ) 
C_  v  /\  `' v  e.  U  /\  E. w  e.  U  ( w  o.  w ) 
C_  v ) )  ->  ( A. w  e.  ~P  ( X  X.  X ) ( V 
C_  w  ->  w  e.  U )  /\  A. w  e.  U  ( V  i^i  w )  e.  U  /\  ( (  _I  |`  X )  C_  V  /\  `' V  e.  U  /\  E. w  e.  U  ( w  o.  w )  C_  V
) ) ) )
205, 19mpan9 457 . . 3  |-  ( ( U  e.  (UnifOn `  X )  /\  V  e.  U )  ->  ( A. w  e.  ~P  ( X  X.  X
) ( V  C_  w  ->  w  e.  U
)  /\  A. w  e.  U  ( V  i^i  w )  e.  U  /\  ( (  _I  |`  X ) 
C_  V  /\  `' V  e.  U  /\  E. w  e.  U  ( w  o.  w ) 
C_  V ) ) )
2120simp3d 972 . 2  |-  ( ( U  e.  (UnifOn `  X )  /\  V  e.  U )  ->  (
(  _I  |`  X ) 
C_  V  /\  `' V  e.  U  /\  E. w  e.  U  ( w  o.  w ) 
C_  V ) )
2221simp3d 972 1  |-  ( ( U  e.  (UnifOn `  X )  /\  V  e.  U )  ->  E. w  e.  U  ( w  o.  w )  C_  V
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 178    /\ wa 360    /\ w3a 937    = wceq 1653    e. wcel 1726   A.wral 2707   E.wrex 2708   _Vcvv 2958    i^i cin 3321    C_ wss 3322   ~Pcpw 3801    _I cid 4496    X. cxp 4879   `'ccnv 4880    |` cres 4883    o. ccom 4885   ` cfv 5457  UnifOncust 18234
This theorem is referenced by:  ustexsym  18250  ustex2sym  18251  ustex3sym  18252  trust  18264  ustuqtop4  18279  neipcfilu  18331
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-13 1728  ax-14 1730  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419  ax-sep 4333  ax-nul 4341  ax-pow 4380  ax-pr 4406  ax-un 4704
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-eu 2287  df-mo 2288  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ne 2603  df-ral 2712  df-rex 2713  df-rab 2716  df-v 2960  df-sbc 3164  df-csb 3254  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-if 3742  df-pw 3803  df-sn 3822  df-pr 3823  df-op 3825  df-uni 4018  df-br 4216  df-opab 4270  df-mpt 4271  df-id 4501  df-xp 4887  df-rel 4888  df-cnv 4889  df-co 4890  df-dm 4891  df-res 4893  df-iota 5421  df-fun 5459  df-fv 5465  df-ust 18235
  Copyright terms: Public domain W3C validator