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

Theorem structfun 12349
Description: Convert between two kinds of structure closure. (Contributed by Mario Carneiro, 29-Aug-2015.) (Proof shortened by AV, 12-Nov-2021.)
Hypothesis
Ref Expression
structfun.1  |-  F Struct  X
Assertion
Ref Expression
structfun  |-  Fun  `' `' F

Proof of Theorem structfun
StepHypRef Expression
1 structfun.1 . 2  |-  F Struct  X
2 structfung 12348 . 2  |-  ( F Struct  X  ->  Fun  `' `' F )
31, 2ax-mp 5 1  |-  Fun  `' `' F
Colors of variables: wff set class
Syntax hints:   class class class wbr 3976   `'ccnv 4597   Fun wfun 5176   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-in1 604  ax-in2 605  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-fal 1348  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-ne 2335  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-nul 3405  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-struct 12333
This theorem is referenced by:  structfn  12350  strslfv  12375
  Copyright terms: Public domain W3C validator