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

Theorem fntp 5438
Description: A function with a domain of three elements. (Contributed by NM, 14-Sep-2011.) (Revised by Mario Carneiro, 26-Apr-2015.)
Hypotheses
Ref Expression
fntp.1  |-  A  e. 
_V
fntp.2  |-  B  e. 
_V
fntp.3  |-  C  e. 
_V
fntp.4  |-  D  e. 
_V
fntp.5  |-  E  e. 
_V
fntp.6  |-  F  e. 
_V
Assertion
Ref Expression
fntp  |-  ( ( A  =/=  B  /\  A  =/=  C  /\  B  =/=  C )  ->  { <. A ,  D >. ,  <. B ,  E >. ,  <. C ,  F >. }  Fn  { A ,  B ,  C } )

Proof of Theorem fntp
StepHypRef Expression
1 fntp.1 . . 3  |-  A  e. 
_V
2 fntp.2 . . 3  |-  B  e. 
_V
3 fntp.3 . . 3  |-  C  e. 
_V
4 fntp.4 . . 3  |-  D  e. 
_V
5 fntp.5 . . 3  |-  E  e. 
_V
6 fntp.6 . . 3  |-  F  e. 
_V
71, 2, 3, 4, 5, 6funtp 5434 . 2  |-  ( ( A  =/=  B  /\  A  =/=  C  /\  B  =/=  C )  ->  Fun  {
<. A ,  D >. , 
<. B ,  E >. , 
<. C ,  F >. } )
84, 5, 6dmtpop 5263 . . 3  |-  dom  { <. A ,  D >. , 
<. B ,  E >. , 
<. C ,  F >. }  =  { A ,  B ,  C }
98a1i 9 . 2  |-  ( ( A  =/=  B  /\  A  =/=  C  /\  B  =/=  C )  ->  dom  {
<. A ,  D >. , 
<. B ,  E >. , 
<. C ,  F >. }  =  { A ,  B ,  C }
)
10 df-fn 5380 . 2  |-  ( {
<. A ,  D >. , 
<. B ,  E >. , 
<. C ,  F >. }  Fn  { A ,  B ,  C }  <->  ( Fun  { <. A ,  D >. ,  <. B ,  E >. ,  <. C ,  F >. }  /\  dom  {
<. A ,  D >. , 
<. B ,  E >. , 
<. C ,  F >. }  =  { A ,  B ,  C }
) )
117, 9, 10sylanbrc 421 1  |-  ( ( A  =/=  B  /\  A  =/=  C  /\  B  =/=  C )  ->  { <. A ,  D >. ,  <. B ,  E >. ,  <. C ,  F >. }  Fn  { A ,  B ,  C } )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ w3a 1009    = wceq 1402    e. wcel 2209    =/= wne 2420   _Vcvv 2821   {ctp 3711   <.cop 3712   dom cdm 4774   Fun wfun 5371    Fn wfn 5372
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-tp 3717  df-op 3718  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-fun 5379  df-fn 5380
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator