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

Theorem fsn2g 5883
Description: A function that maps a singleton to a class is the singleton of an ordered pair. (Contributed by Thierry Arnoux, 11-Jul-2020.)
Assertion
Ref Expression
fsn2g  |-  ( A  e.  V  ->  ( F : { A } --> B 
<->  ( ( F `  A )  e.  B  /\  F  =  { <. A ,  ( F `
 A ) >. } ) ) )

Proof of Theorem fsn2g
Dummy variable  a is distinct from all other variables.
StepHypRef Expression
1 sneq 3720 . . 3  |-  ( a  =  A  ->  { a }  =  { A } )
21feq2d 5521 . 2  |-  ( a  =  A  ->  ( F : { a } --> B  <->  F : { A }
--> B ) )
3 fveq2 5695 . . . 4  |-  ( a  =  A  ->  ( F `  a )  =  ( F `  A ) )
43eleq1d 2307 . . 3  |-  ( a  =  A  ->  (
( F `  a
)  e.  B  <->  ( F `  A )  e.  B
) )
5 id 19 . . . . . 6  |-  ( a  =  A  ->  a  =  A )
65, 3opeq12d 3912 . . . . 5  |-  ( a  =  A  ->  <. a ,  ( F `  a ) >.  =  <. A ,  ( F `  A ) >. )
76sneqd 3722 . . . 4  |-  ( a  =  A  ->  { <. a ,  ( F `  a ) >. }  =  { <. A ,  ( F `  A )
>. } )
87eqeq2d 2250 . . 3  |-  ( a  =  A  ->  ( F  =  { <. a ,  ( F `  a ) >. }  <->  F  =  { <. A ,  ( F `  A )
>. } ) )
94, 8anbi12d 477 . 2  |-  ( a  =  A  ->  (
( ( F `  a )  e.  B  /\  F  =  { <. a ,  ( F `
 a ) >. } )  <->  ( ( F `  A )  e.  B  /\  F  =  { <. A ,  ( F `  A )
>. } ) ) )
10 vex 2824 . . 3  |-  a  e. 
_V
1110fsn2 5882 . 2  |-  ( F : { a } --> B  <->  ( ( F `
 a )  e.  B  /\  F  =  { <. a ,  ( F `  a )
>. } ) )
122, 9, 11vtoclbg 2884 1  |-  ( A  e.  V  ->  ( F : { A } --> B 
<->  ( ( F `  A )  e.  B  /\  F  =  { <. A ,  ( F `
 A ) >. } ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   {csn 3709   <.cop 3712   -->wf 5373   ` cfv 5377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  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-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385
This theorem is used by:  gzsumsplit0  14148
  Copyright terms: Public domain W3C validator