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

Theorem isstructr 12346
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 4665 . . . 4  |-  ( M (  <_  i^i  ( NN  X.  NN ) ) N  <->  ( M  e.  NN  /\  N  e.  NN  /\  M  <_  N ) )
2 df-br 3977 . . . 4  |-  ( M (  <_  i^i  ( NN  X.  NN ) ) N  <->  <. M ,  N >.  e.  (  <_  i^i  ( NN  X.  NN ) ) )
31, 2sylbb1 136 . . 3  |-  ( ( M  e.  NN  /\  N  e.  NN  /\  M  <_  N )  ->  <. M ,  N >.  e.  (  <_  i^i  ( NN  X.  NN ) ) )
43adantr 274 . 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 992 . 2  |-  ( ( ( M  e.  NN  /\  N  e.  NN  /\  M  <_  N )  /\  ( Fun  ( F  \  { (/) } )  /\  F  e.  V  /\  dom  F  C_  ( M ... N ) ) )  ->  Fun  ( F  \  { (/) } ) )
6 simpr2 993 . 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 5839 . . . . . 6  |-  ( M ... N )  =  ( ... `  <. M ,  N >. )
87sseq2i 3164 . . . . 5  |-  ( dom 
F  C_  ( M ... N )  <->  dom  F  C_  ( ... `  <. M ,  N >. ) )
98biimpi 119 . . . 4  |-  ( dom 
F  C_  ( M ... N )  ->  dom  F 
C_  ( ... `  <. M ,  N >. )
)
1093ad2ant3 1009 . . 3  |-  ( ( Fun  ( F  \  { (/) } )  /\  F  e.  V  /\  dom  F  C_  ( M ... N ) )  ->  dom  F  C_  ( ... ` 
<. M ,  N >. ) )
1110adantl 275 . 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 12342 . 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 1228 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 103    /\ w3a 967    e. wcel 2135    \ cdif 3108    i^i cin 3110    C_ wss 3111   (/)c0 3404   {csn 3570   <.cop 3573   class class class wbr 3976    X. cxp 4596   dom cdm 4598   Fun wfun 5176   ` cfv 5182  (class class class)co 5836    <_ cle 7925   NNcn 8848   ...cfz 9935   Struct cstr 12327
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 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ral 2447  df-rex 2448  df-rab 2451  df-v 2723  df-dif 3113  df-un 3115  df-in 3117  df-ss 3124  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-br 3977  df-opab 4038  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-iota 5147  df-fun 5184  df-fv 5190  df-ov 5839  df-struct 12333
This theorem is referenced by:  strleund  12419  strleun  12420  strle1g  12421
  Copyright terms: Public domain W3C validator