ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  isstruct2r Unicode version

Theorem isstruct2r 13212
Description: The property of being a structure with components in  ( 1st `  X
) ... ( 2nd `  X
). (Contributed by Mario Carneiro, 29-Aug-2015.) (Revised by Jim Kingdon, 18-Jan-2023.)
Assertion
Ref Expression
isstruct2r  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  F Struct  X )

Proof of Theorem isstruct2r
Dummy variables  x  f are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpll 527 . 2  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  X  e.  (  <_  i^i  ( NN  X.  NN ) ) )
2 simplr 529 . 2  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  Fun  ( F 
\  { (/) } ) )
3 simprr 533 . 2  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  dom  F  C_  ( ... `  X ) )
4 simprl 531 . . . 4  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  F  e.  V )
54elexd 2826 . . 3  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  F  e.  _V )
6 elex 2824 . . . 4  |-  ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  ->  X  e.  _V )
76ad2antrr 488 . . 3  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  X  e.  _V )
8 simpr 110 . . . . . 6  |-  ( ( f  =  F  /\  x  =  X )  ->  x  =  X )
98eleq1d 2301 . . . . 5  |-  ( ( f  =  F  /\  x  =  X )  ->  ( x  e.  (  <_  i^i  ( NN  X.  NN ) )  <->  X  e.  (  <_  i^i  ( NN  X.  NN ) ) ) )
10 simpl 109 . . . . . . 7  |-  ( ( f  =  F  /\  x  =  X )  ->  f  =  F )
1110difeq1d 3335 . . . . . 6  |-  ( ( f  =  F  /\  x  =  X )  ->  ( f  \  { (/)
} )  =  ( F  \  { (/) } ) )
1211funeqd 5373 . . . . 5  |-  ( ( f  =  F  /\  x  =  X )  ->  ( Fun  ( f 
\  { (/) } )  <->  Fun  ( F  \  { (/)
} ) ) )
1310dmeqd 4957 . . . . . 6  |-  ( ( f  =  F  /\  x  =  X )  ->  dom  f  =  dom  F )
148fveq2d 5673 . . . . . 6  |-  ( ( f  =  F  /\  x  =  X )  ->  ( ... `  x
)  =  ( ... `  X ) )
1513, 14sseq12d 3268 . . . . 5  |-  ( ( f  =  F  /\  x  =  X )  ->  ( dom  f  C_  ( ... `  x )  <->  dom  F  C_  ( ... `  X ) ) )
169, 12, 153anbi123d 1349 . . . 4  |-  ( ( f  =  F  /\  x  =  X )  ->  ( ( x  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( f 
\  { (/) } )  /\  dom  f  C_  ( ... `  x ) )  <->  ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F 
\  { (/) } )  /\  dom  F  C_  ( ... `  X ) ) ) )
17 df-struct 13203 . . . 4  |- Struct  =  { <. f ,  x >.  |  ( x  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( f  \  { (/)
} )  /\  dom  f  C_  ( ... `  x
) ) }
1816, 17brabga 4381 . . 3  |-  ( ( F  e.  _V  /\  X  e.  _V )  ->  ( F Struct  X  <->  ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F 
\  { (/) } )  /\  dom  F  C_  ( ... `  X ) ) ) )
195, 7, 18syl2anc 411 . 2  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  ( F Struct  X  <-> 
( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} )  /\  dom  F 
C_  ( ... `  X
) ) ) )
201, 2, 3, 19mpbir3and 1207 1  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  F Struct  X )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2203   _Vcvv 2812    \ cdif 3207    i^i cin 3209    C_ wss 3210   (/)c0 3507   {csn 3688   class class class wbr 4108    X. cxp 4746   dom cdm 4748   Fun wfun 5345   ` cfv 5351    <_ cle 8305   NNcn 9233   ...cfz 10338   Struct cstr 13197
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-rex 2526  df-rab 2529  df-v 2814  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-br 4109  df-opab 4171  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-iota 5311  df-fun 5353  df-fv 5359  df-struct 13203
This theorem is referenced by:  isstructr  13216
  Copyright terms: Public domain W3C validator