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

Theorem undiffi 7222
Description: Union of complementary parts into whole. This is a case where we can strengthen undifss 3605 from subset to equality. (Contributed by Jim Kingdon, 2-Mar-2022.)
Assertion
Ref Expression
undiffi  |-  ( ( A  e.  Fin  /\  B  e.  Fin  /\  B  C_  A )  ->  A  =  ( B  u.  ( A  \  B ) ) )

Proof of Theorem undiffi
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fidceq 7161 . . . 4  |-  ( ( A  e.  Fin  /\  x  e.  A  /\  y  e.  A )  -> DECID  x  =  y )
213expb 1235 . . 3  |-  ( ( A  e.  Fin  /\  ( x  e.  A  /\  y  e.  A
) )  -> DECID  x  =  y
)
32ralrimivva 2632 . 2  |-  ( A  e.  Fin  ->  A. x  e.  A  A. y  e.  A DECID  x  =  y
)
4 undifdc 7221 . 2  |-  ( ( A. x  e.  A  A. y  e.  A DECID  x  =  y  /\  B  e. 
Fin  /\  B  C_  A
)  ->  A  =  ( B  u.  ( A  \  B ) ) )
53, 4syl3an1 1311 1  |-  ( ( A  e.  Fin  /\  B  e.  Fin  /\  B  C_  A )  ->  A  =  ( B  u.  ( A  \  B ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4  DECID wdc 846    /\ w3a 1009    = wceq 1402    e. wcel 2209   A.wral 2528    \ cdif 3217    u. cun 3218    C_ wss 3220   Fincfn 7012
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 4241  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-iinf 4730
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-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 3636  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-iom 4733  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-er 6797  df-en 7013  df-fin 7015
This theorem is referenced by:  unfiin  7223  fihashssdif  11237  hashfibclem  11260  hashf1lem2  11264  fsumlessfi  12205  fprodsplit1f  12379
  Copyright terms: Public domain W3C validator