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

Theorem hashtpgim 11221
Description: The size of an unordered triple of three different elements. (Contributed by Alexander van der Vekens, 10-Nov-2017.) (Revised by AV, 18-Sep-2021.) (Revised by Jim Kingdon, 17-Apr-2026.)
Assertion
Ref Expression
hashtpgim  |-  ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W )  ->  ( ( A  =/= 
B  /\  B  =/=  C  /\  C  =/=  A
)  ->  ( `  { A ,  B ,  C } )  =  3 ) )

Proof of Theorem hashtpgim
StepHypRef Expression
1 df-tp 3699 . . . . 5  |-  { A ,  B ,  C }  =  ( { A ,  B }  u.  { C } )
21fveq2i 5675 . . . 4  |-  ( `  { A ,  B ,  C } )  =  ( `  ( { A ,  B }  u.  { C } ) )
3 simpl1 1027 . . . . . 6  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  A  e.  U )
4 simpl2 1028 . . . . . 6  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  B  e.  V )
5 simpr1 1030 . . . . . 6  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  A  =/=  B )
6 prfidisj 7189 . . . . . 6  |-  ( ( A  e.  U  /\  B  e.  V  /\  A  =/=  B )  ->  { A ,  B }  e.  Fin )
73, 4, 5, 6syl3anc 1274 . . . . 5  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  { A ,  B }  e.  Fin )
8 simpl3 1029 . . . . . 6  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  C  e.  W )
9 snfig 7058 . . . . . 6  |-  ( C  e.  W  ->  { C }  e.  Fin )
108, 9syl 14 . . . . 5  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  { C }  e.  Fin )
11 dfsn2 3705 . . . . . . 7  |-  { C }  =  { C ,  C }
1211ineq2i 3421 . . . . . 6  |-  ( { A ,  B }  i^i  { C } )  =  ( { A ,  B }  i^i  { C ,  C }
)
13 simpr3 1032 . . . . . . . 8  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  C  =/=  A )
1413necomd 2500 . . . . . . 7  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  A  =/=  C )
15 simpr2 1031 . . . . . . 7  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  B  =/=  C )
16 disjpr2 3755 . . . . . . 7  |-  ( ( ( A  =/=  C  /\  B  =/=  C
)  /\  ( A  =/=  C  /\  B  =/= 
C ) )  -> 
( { A ,  B }  i^i  { C ,  C } )  =  (/) )
1714, 15, 14, 15, 16syl22anc 1275 . . . . . 6  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  ( { A ,  B }  i^i  { C ,  C } )  =  (/) )
1812, 17eqtrid 2279 . . . . 5  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  ( { A ,  B }  i^i  { C } )  =  (/) )
19 hashun 11173 . . . . 5  |-  ( ( { A ,  B }  e.  Fin  /\  { C }  e.  Fin  /\  ( { A ,  B }  i^i  { C } )  =  (/) )  ->  ( `  ( { A ,  B }  u.  { C } ) )  =  ( ( `  { A ,  B } )  +  ( `  { C } ) ) )
207, 10, 18, 19syl3anc 1274 . . . 4  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  ( `  ( { A ,  B }  u.  { C } ) )  =  ( ( `  { A ,  B }
)  +  ( `  { C } ) ) )
212, 20eqtrid 2279 . . 3  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  ( `  { A ,  B ,  C } )  =  ( ( `  { A ,  B }
)  +  ( `  { C } ) ) )
22 hashprg 11177 . . . . . . 7  |-  ( ( A  e.  U  /\  B  e.  V )  ->  ( A  =/=  B  <->  ( `  { A ,  B } )  =  2 ) )
233, 4, 22syl2anc 411 . . . . . 6  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  ( A  =/=  B  <->  ( `  { A ,  B }
)  =  2 ) )
245, 23mpbid 147 . . . . 5  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  ( `  { A ,  B } )  =  2 )
25 hashsng 11165 . . . . . 6  |-  ( C  e.  W  ->  ( `  { C } )  =  1 )
268, 25syl 14 . . . . 5  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  ( `  { C } )  =  1 )
2724, 26oveq12d 6070 . . . 4  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  (
( `  { A ,  B } )  +  ( `  { C } ) )  =  ( 2  +  1 ) )
28 2p1e3 9373 . . . 4  |-  ( 2  +  1 )  =  3
2927, 28eqtrdi 2283 . . 3  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  (
( `  { A ,  B } )  +  ( `  { C } ) )  =  3 )
3021, 29eqtrd 2267 . 2  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  ( `  { A ,  B ,  C } )  =  3 )
3130ex 115 1  |-  ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W )  ->  ( ( A  =/= 
B  /\  B  =/=  C  /\  C  =/=  A
)  ->  ( `  { A ,  B ,  C } )  =  3 ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2205    =/= wne 2414    u. cun 3211    i^i cin 3212   (/)c0 3510   {csn 3691   {cpr 3692   {ctp 3693   ` cfv 5354  (class class class)co 6052   Fincfn 6977   1c1 8130    + caddc 8132   2c2 9290   3c3 9291  ♯chash 11142
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712  ax-cnex 8220  ax-resscn 8221  ax-1cn 8222  ax-1re 8223  ax-icn 8224  ax-addcl 8225  ax-addrcl 8226  ax-mulcl 8227  ax-addcom 8229  ax-addass 8231  ax-distr 8233  ax-i2m1 8234  ax-0lt1 8235  ax-0id 8237  ax-rnegex 8238  ax-cnre 8240  ax-pre-ltirr 8241  ax-pre-ltwlin 8242  ax-pre-lttrn 8243  ax-pre-apti 8244  ax-pre-ltadd 8245
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-tp 3699  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-iord 4489  df-on 4491  df-ilim 4492  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-irdg 6603  df-frec 6624  df-1o 6649  df-oadd 6653  df-er 6769  df-en 6978  df-dom 6979  df-fin 6980  df-pnf 8312  df-mnf 8313  df-xr 8314  df-ltxr 8315  df-le 8316  df-sub 8448  df-neg 8449  df-inn 9240  df-2 9298  df-3 9299  df-n0 9499  df-z 9580  df-uz 9857  df-fz 10346  df-ihash 11143
This theorem is referenced by:  hashtpg  11223
  Copyright terms: Public domain W3C validator