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

Theorem isstruct2r 11959
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 518 . 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 519 . 2  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  Fun  ( F 
\  { (/) } ) )
3 simprr 521 . 2  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  dom  F  C_  ( ... `  X ) )
4 simprl 520 . . . 4  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  F  e.  V )
54elexd 2694 . . 3  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  F  e.  _V )
6 elex 2692 . . . 4  |-  ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  ->  X  e.  _V )
76ad2antrr 479 . . 3  |-  ( ( ( X  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/)
} ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... `  X ) ) )  ->  X  e.  _V )
8 simpr 109 . . . . . 6  |-  ( ( f  =  F  /\  x  =  X )  ->  x  =  X )
98eleq1d 2206 . . . . 5  |-  ( ( f  =  F  /\  x  =  X )  ->  ( x  e.  (  <_  i^i  ( NN  X.  NN ) )  <->  X  e.  (  <_  i^i  ( NN  X.  NN ) ) ) )
10 simpl 108 . . . . . . 7  |-  ( ( f  =  F  /\  x  =  X )  ->  f  =  F )
1110difeq1d 3188 . . . . . 6  |-  ( ( f  =  F  /\  x  =  X )  ->  ( f  \  { (/)
} )  =  ( F  \  { (/) } ) )
1211funeqd 5140 . . . . 5  |-  ( ( f  =  F  /\  x  =  X )  ->  ( Fun  ( f 
\  { (/) } )  <->  Fun  ( F  \  { (/)
} ) ) )
1310dmeqd 4736 . . . . . 6  |-  ( ( f  =  F  /\  x  =  X )  ->  dom  f  =  dom  F )
148fveq2d 5418 . . . . . 6  |-  ( ( f  =  F  /\  x  =  X )  ->  ( ... `  x
)  =  ( ... `  X ) )
1513, 14sseq12d 3123 . . . . 5  |-  ( ( f  =  F  /\  x  =  X )  ->  ( dom  f  C_  ( ... `  x )  <->  dom  F  C_  ( ... `  X ) ) )
169, 12, 153anbi123d 1290 . . . 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 11950 . . . 4  |- Struct  =  { <. f ,  x >.  |  ( x  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( f  \  { (/)
} )  /\  dom  f  C_  ( ... `  x
) ) }
1816, 17brabga 4181 . . 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 408 . 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 1164 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 103    <-> wb 104    /\ w3a 962    = wceq 1331    e. wcel 1480   _Vcvv 2681    \ cdif 3063    i^i cin 3065    C_ wss 3066   (/)c0 3358   {csn 3522   class class class wbr 3924    X. cxp 4532   dom cdm 4534   Fun wfun 5112   ` cfv 5118    <_ cle 7794   NNcn 8713   ...cfz 9783   Struct cstr 11944
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-rex 2420  df-rab 2423  df-v 2683  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-br 3925  df-opab 3985  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-iota 5083  df-fun 5120  df-fv 5126  df-struct 11950
This theorem is referenced by:  isstructr  11963
  Copyright terms: Public domain W3C validator