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

Theorem isstructr 13068
Description: The property of being a structure with components in  M ... N. (Contributed by Mario Carneiro, 29-Aug-2015.) (Revised by Jim Kingdon, 18-Jan-2023.)
Assertion
Ref Expression
isstructr  |-  ( ( ( M  e.  NN  /\  N  e.  NN  /\  M  <_  N )  /\  ( Fun  ( F  \  { (/) } )  /\  F  e.  V  /\  dom  F  C_  ( M ... N ) ) )  ->  F Struct  <. M ,  N >. )

Proof of Theorem isstructr
StepHypRef Expression
1 brinxp2 4788 . . . 4  |-  ( M (  <_  i^i  ( NN  X.  NN ) ) N  <->  ( M  e.  NN  /\  N  e.  NN  /\  M  <_  N ) )
2 df-br 4084 . . . 4  |-  ( M (  <_  i^i  ( NN  X.  NN ) ) N  <->  <. M ,  N >.  e.  (  <_  i^i  ( NN  X.  NN ) ) )
31, 2sylbb1 137 . . 3  |-  ( ( M  e.  NN  /\  N  e.  NN  /\  M  <_  N )  ->  <. M ,  N >.  e.  (  <_  i^i  ( NN  X.  NN ) ) )
43adantr 276 . 2  |-  ( ( ( M  e.  NN  /\  N  e.  NN  /\  M  <_  N )  /\  ( Fun  ( F  \  { (/) } )  /\  F  e.  V  /\  dom  F  C_  ( M ... N ) ) )  ->  <. M ,  N >.  e.  (  <_  i^i  ( NN  X.  NN ) ) )
5 simpr1 1027 . 2  |-  ( ( ( M  e.  NN  /\  N  e.  NN  /\  M  <_  N )  /\  ( Fun  ( F  \  { (/) } )  /\  F  e.  V  /\  dom  F  C_  ( M ... N ) ) )  ->  Fun  ( F  \  { (/) } ) )
6 simpr2 1028 . 2  |-  ( ( ( M  e.  NN  /\  N  e.  NN  /\  M  <_  N )  /\  ( Fun  ( F  \  { (/) } )  /\  F  e.  V  /\  dom  F  C_  ( M ... N ) ) )  ->  F  e.  V
)
7 df-ov 6013 . . . . . 6  |-  ( M ... N )  =  ( ... `  <. M ,  N >. )
87sseq2i 3251 . . . . 5  |-  ( dom 
F  C_  ( M ... N )  <->  dom  F  C_  ( ... `  <. M ,  N >. ) )
98biimpi 120 . . . 4  |-  ( dom 
F  C_  ( M ... N )  ->  dom  F 
C_  ( ... `  <. M ,  N >. )
)
1093ad2ant3 1044 . . 3  |-  ( ( Fun  ( F  \  { (/) } )  /\  F  e.  V  /\  dom  F  C_  ( M ... N ) )  ->  dom  F  C_  ( ... ` 
<. M ,  N >. ) )
1110adantl 277 . 2  |-  ( ( ( M  e.  NN  /\  N  e.  NN  /\  M  <_  N )  /\  ( Fun  ( F  \  { (/) } )  /\  F  e.  V  /\  dom  F  C_  ( M ... N ) ) )  ->  dom  F  C_  ( ... `  <. M ,  N >. ) )
12 isstruct2r 13064 . 2  |-  ( ( ( <. M ,  N >.  e.  (  <_  i^i  ( NN  X.  NN ) )  /\  Fun  ( F  \  { (/) } ) )  /\  ( F  e.  V  /\  dom  F  C_  ( ... ` 
<. M ,  N >. ) ) )  ->  F Struct  <. M ,  N >. )
134, 5, 6, 11, 12syl22anc 1272 1  |-  ( ( ( M  e.  NN  /\  N  e.  NN  /\  M  <_  N )  /\  ( Fun  ( F  \  { (/) } )  /\  F  e.  V  /\  dom  F  C_  ( M ... N ) ) )  ->  F Struct  <. M ,  N >. )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1002    e. wcel 2200    \ cdif 3194    i^i cin 3196    C_ wss 3197   (/)c0 3491   {csn 3666   <.cop 3669   class class class wbr 4083    X. cxp 4718   dom cdm 4720   Fun wfun 5315   ` cfv 5321  (class class class)co 6010    <_ cle 8198   NNcn 9126   ...cfz 10221   Struct cstr 13049
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4259  ax-pr 4294
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-iota 5281  df-fun 5323  df-fv 5329  df-ov 6013  df-struct 13055
This theorem is referenced by:  strleund  13157  strleun  13158  strext  13159  strle1g  13160
  Copyright terms: Public domain W3C validator