MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  f1dom3fv3dif Structured version   Visualization version   Unicode version

Theorem f1dom3fv3dif 6525
Description: The function values for a 1-1 function from a set with three different elements are different. (Contributed by AV, 20-Mar-2019.)
Hypotheses
Ref Expression
f1dom3fv3dif.v  |-  ( ph  ->  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
) )
f1dom3fv3dif.n  |-  ( ph  ->  ( A  =/=  B  /\  A  =/=  C  /\  B  =/=  C
) )
f1dom3fv3dif.f  |-  ( ph  ->  F : { A ,  B ,  C } -1-1->
R )
Assertion
Ref Expression
f1dom3fv3dif  |-  ( ph  ->  ( ( F `  A )  =/=  ( F `  B )  /\  ( F `  A
)  =/=  ( F `
 C )  /\  ( F `  B )  =/=  ( F `  C ) ) )

Proof of Theorem f1dom3fv3dif
StepHypRef Expression
1 f1dom3fv3dif.n . . . 4  |-  ( ph  ->  ( A  =/=  B  /\  A  =/=  C  /\  B  =/=  C
) )
21simp1d 1073 . . 3  |-  ( ph  ->  A  =/=  B )
3 f1dom3fv3dif.f . . . . 5  |-  ( ph  ->  F : { A ,  B ,  C } -1-1->
R )
4 eqidd 2623 . . . . . . 7  |-  ( ph  ->  A  =  A )
543mix1d 1236 . . . . . 6  |-  ( ph  ->  ( A  =  A  \/  A  =  B  \/  A  =  C ) )
6 f1dom3fv3dif.v . . . . . . . 8  |-  ( ph  ->  ( A  e.  X  /\  B  e.  Y  /\  C  e.  Z
) )
76simp1d 1073 . . . . . . 7  |-  ( ph  ->  A  e.  X )
8 eltpg 4227 . . . . . . 7  |-  ( A  e.  X  ->  ( A  e.  { A ,  B ,  C }  <->  ( A  =  A  \/  A  =  B  \/  A  =  C )
) )
97, 8syl 17 . . . . . 6  |-  ( ph  ->  ( A  e.  { A ,  B ,  C }  <->  ( A  =  A  \/  A  =  B  \/  A  =  C ) ) )
105, 9mpbird 247 . . . . 5  |-  ( ph  ->  A  e.  { A ,  B ,  C }
)
11 eqidd 2623 . . . . . . 7  |-  ( ph  ->  B  =  B )
12113mix2d 1237 . . . . . 6  |-  ( ph  ->  ( B  =  A  \/  B  =  B  \/  B  =  C ) )
136simp2d 1074 . . . . . . 7  |-  ( ph  ->  B  e.  Y )
14 eltpg 4227 . . . . . . 7  |-  ( B  e.  Y  ->  ( B  e.  { A ,  B ,  C }  <->  ( B  =  A  \/  B  =  B  \/  B  =  C )
) )
1513, 14syl 17 . . . . . 6  |-  ( ph  ->  ( B  e.  { A ,  B ,  C }  <->  ( B  =  A  \/  B  =  B  \/  B  =  C ) ) )
1612, 15mpbird 247 . . . . 5  |-  ( ph  ->  B  e.  { A ,  B ,  C }
)
17 f1fveq 6519 . . . . 5  |-  ( ( F : { A ,  B ,  C } -1-1->
R  /\  ( A  e.  { A ,  B ,  C }  /\  B  e.  { A ,  B ,  C } ) )  ->  ( ( F `
 A )  =  ( F `  B
)  <->  A  =  B
) )
183, 10, 16, 17syl12anc 1324 . . . 4  |-  ( ph  ->  ( ( F `  A )  =  ( F `  B )  <-> 
A  =  B ) )
1918necon3bid 2838 . . 3  |-  ( ph  ->  ( ( F `  A )  =/=  ( F `  B )  <->  A  =/=  B ) )
202, 19mpbird 247 . 2  |-  ( ph  ->  ( F `  A
)  =/=  ( F `
 B ) )
211simp2d 1074 . . 3  |-  ( ph  ->  A  =/=  C )
226simp3d 1075 . . . . . 6  |-  ( ph  ->  C  e.  Z )
23 tpid3g 4305 . . . . . 6  |-  ( C  e.  Z  ->  C  e.  { A ,  B ,  C } )
2422, 23syl 17 . . . . 5  |-  ( ph  ->  C  e.  { A ,  B ,  C }
)
25 f1fveq 6519 . . . . 5  |-  ( ( F : { A ,  B ,  C } -1-1->
R  /\  ( A  e.  { A ,  B ,  C }  /\  C  e.  { A ,  B ,  C } ) )  ->  ( ( F `
 A )  =  ( F `  C
)  <->  A  =  C
) )
263, 10, 24, 25syl12anc 1324 . . . 4  |-  ( ph  ->  ( ( F `  A )  =  ( F `  C )  <-> 
A  =  C ) )
2726necon3bid 2838 . . 3  |-  ( ph  ->  ( ( F `  A )  =/=  ( F `  C )  <->  A  =/=  C ) )
2821, 27mpbird 247 . 2  |-  ( ph  ->  ( F `  A
)  =/=  ( F `
 C ) )
291simp3d 1075 . . 3  |-  ( ph  ->  B  =/=  C )
30 f1fveq 6519 . . . . 5  |-  ( ( F : { A ,  B ,  C } -1-1->
R  /\  ( B  e.  { A ,  B ,  C }  /\  C  e.  { A ,  B ,  C } ) )  ->  ( ( F `
 B )  =  ( F `  C
)  <->  B  =  C
) )
313, 16, 24, 30syl12anc 1324 . . . 4  |-  ( ph  ->  ( ( F `  B )  =  ( F `  C )  <-> 
B  =  C ) )
3231necon3bid 2838 . . 3  |-  ( ph  ->  ( ( F `  B )  =/=  ( F `  C )  <->  B  =/=  C ) )
3329, 32mpbird 247 . 2  |-  ( ph  ->  ( F `  B
)  =/=  ( F `
 C ) )
3420, 28, 333jca 1242 1  |-  ( ph  ->  ( ( F `  A )  =/=  ( F `  B )  /\  ( F `  A
)  =/=  ( F `
 C )  /\  ( F `  B )  =/=  ( F `  C ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    \/ w3o 1036    /\ w3a 1037    = wceq 1483    e. wcel 1990    =/= wne 2794   {ctp 4181   -1-1->wf1 5885   ` cfv 5888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fv 5896
This theorem is referenced by:  f1dom3el3dif  6526
  Copyright terms: Public domain W3C validator