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

Theorem dif1enen 7112
Description: Subtracting one element from each of two equinumerous finite sets. (Contributed by Jim Kingdon, 5-Jun-2022.)
Hypotheses
Ref Expression
dif1enen.a  |-  ( ph  ->  A  e.  Fin )
dif1enen.ab  |-  ( ph  ->  A  ~~  B )
dif1enen.c  |-  ( ph  ->  C  e.  A )
dif1enen.d  |-  ( ph  ->  D  e.  B )
Assertion
Ref Expression
dif1enen  |-  ( ph  ->  ( A  \  { C } )  ~~  ( B  \  { D }
) )

Proof of Theorem dif1enen
Dummy variables  m  n are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dif1enen.a . . 3  |-  ( ph  ->  A  e.  Fin )
2 isfi 6977 . . 3  |-  ( A  e.  Fin  <->  E. n  e.  om  A  ~~  n
)
31, 2sylib 122 . 2  |-  ( ph  ->  E. n  e.  om  A  ~~  n )
4 simplrr 538 . . . . . 6  |-  ( ( ( ph  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  n  =  (/) )  ->  A  ~~  n
)
5 breq2 4097 . . . . . . 7  |-  ( n  =  (/)  ->  ( A 
~~  n  <->  A  ~~  (/) ) )
65adantl 277 . . . . . 6  |-  ( ( ( ph  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  n  =  (/) )  ->  ( A  ~~  n 
<->  A  ~~  (/) ) )
74, 6mpbid 147 . . . . 5  |-  ( ( ( ph  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  n  =  (/) )  ->  A  ~~  (/) )
8 en0 7012 . . . . 5  |-  ( A 
~~  (/)  <->  A  =  (/) )
97, 8sylib 122 . . . 4  |-  ( ( ( ph  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  n  =  (/) )  ->  A  =  (/) )
10 dif1enen.c . . . . . 6  |-  ( ph  ->  C  e.  A )
11 n0i 3502 . . . . . 6  |-  ( C  e.  A  ->  -.  A  =  (/) )
1210, 11syl 14 . . . . 5  |-  ( ph  ->  -.  A  =  (/) )
1312ad2antrr 488 . . . 4  |-  ( ( ( ph  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  n  =  (/) )  ->  -.  A  =  (/) )
149, 13pm2.21dd 625 . . 3  |-  ( ( ( ph  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  n  =  (/) )  ->  ( A  \  { C } )  ~~  ( B  \  { D } ) )
15 simplr 529 . . . . . . . 8  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  ->  m  e.  om )
16 simprr 533 . . . . . . . . . 10  |-  ( (
ph  /\  ( n  e.  om  /\  A  ~~  n ) )  ->  A  ~~  n )
1716ad2antrr 488 . . . . . . . . 9  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  ->  A  ~~  n )
18 breq2 4097 . . . . . . . . . 10  |-  ( n  =  suc  m  -> 
( A  ~~  n  <->  A 
~~  suc  m )
)
1918adantl 277 . . . . . . . . 9  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  -> 
( A  ~~  n  <->  A 
~~  suc  m )
)
2017, 19mpbid 147 . . . . . . . 8  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  ->  A  ~~  suc  m )
2110ad3antrrr 492 . . . . . . . 8  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  ->  C  e.  A )
22 dif1en 7111 . . . . . . . 8  |-  ( ( m  e.  om  /\  A  ~~  suc  m  /\  C  e.  A )  ->  ( A  \  { C } )  ~~  m
)
2315, 20, 21, 22syl3anc 1274 . . . . . . 7  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  -> 
( A  \  { C } )  ~~  m
)
24 dif1enen.ab . . . . . . . . . . . 12  |-  ( ph  ->  A  ~~  B )
2524ad3antrrr 492 . . . . . . . . . . 11  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  ->  A  ~~  B )
2625ensymd 7000 . . . . . . . . . 10  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  ->  B  ~~  A )
27 entr 7001 . . . . . . . . . 10  |-  ( ( B  ~~  A  /\  A  ~~  suc  m )  ->  B  ~~  suc  m )
2826, 20, 27syl2anc 411 . . . . . . . . 9  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  ->  B  ~~  suc  m )
29 dif1enen.d . . . . . . . . . 10  |-  ( ph  ->  D  e.  B )
3029ad3antrrr 492 . . . . . . . . 9  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  ->  D  e.  B )
31 dif1en 7111 . . . . . . . . 9  |-  ( ( m  e.  om  /\  B  ~~  suc  m  /\  D  e.  B )  ->  ( B  \  { D } )  ~~  m
)
3215, 28, 30, 31syl3anc 1274 . . . . . . . 8  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  -> 
( B  \  { D } )  ~~  m
)
3332ensymd 7000 . . . . . . 7  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  ->  m  ~~  ( B  \  { D } ) )
34 entr 7001 . . . . . . 7  |-  ( ( ( A  \  { C } )  ~~  m  /\  m  ~~  ( B 
\  { D }
) )  ->  ( A  \  { C }
)  ~~  ( B  \  { D } ) )
3523, 33, 34syl2anc 411 . . . . . 6  |-  ( ( ( ( ph  /\  ( n  e.  om  /\  A  ~~  n ) )  /\  m  e. 
om )  /\  n  =  suc  m )  -> 
( A  \  { C } )  ~~  ( B  \  { D }
) )
3635ex 115 . . . . 5  |-  ( ( ( ph  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  m  e.  om )  ->  ( n  =  suc  m  ->  ( A  \  { C }
)  ~~  ( B  \  { D } ) ) )
3736rexlimdva 2651 . . . 4  |-  ( (
ph  /\  ( n  e.  om  /\  A  ~~  n ) )  -> 
( E. m  e. 
om  n  =  suc  m  ->  ( A  \  { C } )  ~~  ( B  \  { D } ) ) )
3837imp 124 . . 3  |-  ( ( ( ph  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  E. m  e. 
om  n  =  suc  m )  ->  ( A  \  { C }
)  ~~  ( B  \  { D } ) )
39 nn0suc 4708 . . . 4  |-  ( n  e.  om  ->  (
n  =  (/)  \/  E. m  e.  om  n  =  suc  m ) )
4039ad2antrl 490 . . 3  |-  ( (
ph  /\  ( n  e.  om  /\  A  ~~  n ) )  -> 
( n  =  (/)  \/ 
E. m  e.  om  n  =  suc  m ) )
4114, 38, 40mpjaodan 806 . 2  |-  ( (
ph  /\  ( n  e.  om  /\  A  ~~  n ) )  -> 
( A  \  { C } )  ~~  ( B  \  { D }
) )
423, 41rexlimddv 2656 1  |-  ( ph  ->  ( A  \  { C } )  ~~  ( B  \  { D }
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 716    = wceq 1398    e. wcel 2202   E.wrex 2512    \ cdif 3198   (/)c0 3496   {csn 3673   class class class wbr 4093   suc csuc 4468   omcom 4694    ~~ cen 6950   Fincfn 6952
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-er 6745  df-en 6953  df-fin 6955
This theorem is referenced by:  fisseneq  7170
  Copyright terms: Public domain W3C validator