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

Theorem hashtpgim 11280
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 3716 . . . . 5  |-  { A ,  B ,  C }  =  ( { A ,  B }  u.  { C } )
21fveq2i 5696 . . . 4  |-  ( `  { A ,  B ,  C } )  =  ( `  ( { A ,  B }  u.  { C } ) )
3 simpl1 1031 . . . . . 6  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  A  e.  U )
4 simpl2 1032 . . . . . 6  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  B  e.  V )
5 simpr1 1034 . . . . . 6  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  A  =/=  B )
6 prfidisj 7228 . . . . . 6  |-  ( ( A  e.  U  /\  B  e.  V  /\  A  =/=  B )  ->  { A ,  B }  e.  Fin )
73, 4, 5, 6syl3anc 1278 . . . . 5  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  { A ,  B }  e.  Fin )
8 simpl3 1033 . . . . . 6  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  C  e.  W )
9 snfig 7097 . . . . . 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 3722 . . . . . . 7  |-  { C }  =  { C ,  C }
1211ineq2i 3429 . . . . . 6  |-  ( { A ,  B }  i^i  { C } )  =  ( { A ,  B }  i^i  { C ,  C }
)
13 simpr3 1036 . . . . . . . 8  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  C  =/=  A )
1413necomd 2506 . . . . . . 7  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  A  =/=  C )
15 simpr2 1035 . . . . . . 7  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  B  =/=  C )
16 disjpr2 3772 . . . . . . 7  |-  ( ( ( A  =/=  C  /\  B  =/=  C
)  /\  ( A  =/=  C  /\  B  =/= 
C ) )  -> 
( { A ,  B }  i^i  { C ,  C } )  =  (/) )
1714, 15, 14, 15, 16syl22anc 1279 . . . . . 6  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  ( { A ,  B }  i^i  { C ,  C } )  =  (/) )
1812, 17eqtrid 2283 . . . . 5  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  ( { A ,  B }  i^i  { C } )  =  (/) )
19 hashun 11228 . . . . 5  |-  ( ( { A ,  B }  e.  Fin  /\  { C }  e.  Fin  /\  ( { A ,  B }  i^i  { C } )  =  (/) )  ->  ( `  ( { A ,  B }  u.  { C } ) )  =  ( ( `  { A ,  B } )  +  ( `  { C } ) ) )
207, 10, 18, 19syl3anc 1278 . . . 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 2283 . . 3  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  ( `  { A ,  B ,  C } )  =  ( ( `  { A ,  B }
)  +  ( `  { C } ) ) )
22 hashprg 11232 . . . . . . 7  |-  ( ( A  e.  U  /\  B  e.  V )  ->  ( A  =/=  B  <->  ( `  { A ,  B } )  =  2 ) )
233, 4, 22syl2anc 415 . . . . . 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 11220 . . . . . 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 6097 . . . 4  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  (
( `  { A ,  B } )  +  ( `  { C } ) )  =  ( 2  +  1 ) )
28 2p1e3 9421 . . . 4  |-  ( 2  +  1 )  =  3
2927, 28eqtrdi 2287 . . 3  |-  ( ( ( A  e.  U  /\  B  e.  V  /\  C  e.  W
)  /\  ( A  =/=  B  /\  B  =/= 
C  /\  C  =/=  A ) )  ->  (
( `  { A ,  B } )  +  ( `  { C } ) )  =  3 )
3021, 29eqtrd 2271 . 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 1009    = wceq 1402    e. wcel 2209    =/= wne 2420    u. cun 3218    i^i cin 3219   (/)c0 3520   {csn 3708   {cpr 3709   {ctp 3710   ` cfv 5375  (class class class)co 6079   Fincfn 7016   1c1 8174    + caddc 8176   2c2 9338   3c3 9339  ♯chash 11197
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 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-coll 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-addcom 8273  ax-addass 8275  ax-distr 8277  ax-i2m1 8278  ax-0lt1 8279  ax-0id 8281  ax-rnegex 8282  ax-cnre 8284  ax-pre-ltirr 8285  ax-pre-ltwlin 8286  ax-pre-lttrn 8287  ax-pre-apti 8288  ax-pre-ltadd 8289
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  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-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3714  df-pr 3715  df-tp 3716  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-iord 4509  df-on 4511  df-ilim 4512  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-recs 6570  df-irdg 6635  df-frec 6656  df-1o 6681  df-oadd 6685  df-er 6801  df-en 7017  df-dom 7018  df-fin 7019  df-pnf 8356  df-mnf 8357  df-xr 8358  df-ltxr 8359  df-le 8360  df-sub 8493  df-neg 8494  df-inn 9288  df-2 9346  df-3 9347  df-n0 9547  df-z 9628  df-uz 9905  df-fz 10395  df-ihash 11198
This theorem is referenced by:  hashtpg  11282
  Copyright terms: Public domain W3C validator