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

Theorem dif1en 7136
Description: If a set  A is equinumerous to the successor of a natural number  M, then  A with an element removed is equinumerous to  M. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Stefan O'Rear, 16-Aug-2015.)
Assertion
Ref Expression
dif1en  |-  ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A )  ->  ( A  \  { X } )  ~~  M
)

Proof of Theorem dif1en
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 simp2 1025 . . . 4  |-  ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A )  ->  A  ~~  suc  M
)
21ensymd 7023 . . 3  |-  ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A )  ->  suc  M  ~~  A
)
3 bren 6983 . . 3  |-  ( suc 
M  ~~  A  <->  E. f 
f : suc  M -1-1-onto-> A
)
42, 3sylib 122 . 2  |-  ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A )  ->  E. f  f : suc  M -1-1-onto-> A )
5 peano2 4717 . . . . . . . 8  |-  ( M  e.  om  ->  suc  M  e.  om )
6 nnfi 7127 . . . . . . . 8  |-  ( suc 
M  e.  om  ->  suc 
M  e.  Fin )
75, 6syl 14 . . . . . . 7  |-  ( M  e.  om  ->  suc  M  e.  Fin )
873ad2ant1 1045 . . . . . 6  |-  ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A )  ->  suc  M  e.  Fin )
9 enfii 7129 . . . . . 6  |-  ( ( suc  M  e.  Fin  /\  A  ~~  suc  M
)  ->  A  e.  Fin )
108, 1, 9syl2anc 411 . . . . 5  |-  ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A )  ->  A  e.  Fin )
1110adantr 276 . . . 4  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  A  e.  Fin )
12 simpl3 1029 . . . 4  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  X  e.  A )
13 f1of 5614 . . . . . 6  |-  ( f : suc  M -1-1-onto-> A  -> 
f : suc  M --> A )
1413adantl 277 . . . . 5  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  f : suc  M --> A )
15 sucidg 4537 . . . . . . 7  |-  ( M  e.  om  ->  M  e.  suc  M )
16153ad2ant1 1045 . . . . . 6  |-  ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A )  ->  M  e.  suc  M
)
1716adantr 276 . . . . 5  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  M  e.  suc  M )
1814, 17ffvelcdmd 5813 . . . 4  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  (
f `  M )  e.  A )
19 fidifsnen 7125 . . . 4  |-  ( ( A  e.  Fin  /\  X  e.  A  /\  ( f `  M
)  e.  A )  ->  ( A  \  { X } )  ~~  ( A  \  { ( f `  M ) } ) )
2011, 12, 18, 19syl3anc 1274 . . 3  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  ( A  \  { X }
)  ~~  ( A  \  { ( f `  M ) } ) )
21 nnord 4734 . . . . . . . 8  |-  ( M  e.  om  ->  Ord  M )
22 orddif 4669 . . . . . . . 8  |-  ( Ord 
M  ->  M  =  ( suc  M  \  { M } ) )
2321, 22syl 14 . . . . . . 7  |-  ( M  e.  om  ->  M  =  ( suc  M  \  { M } ) )
24233ad2ant1 1045 . . . . . 6  |-  ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A )  ->  M  =  ( suc 
M  \  { M } ) )
2524adantr 276 . . . . 5  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  M  =  ( suc  M  \  { M } ) )
2623eleq1d 2301 . . . . . . . . 9  |-  ( M  e.  om  ->  ( M  e.  om  <->  ( suc  M 
\  { M }
)  e.  om )
)
2726ibi 176 . . . . . . . 8  |-  ( M  e.  om  ->  ( suc  M  \  { M } )  e.  om )
28273ad2ant1 1045 . . . . . . 7  |-  ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A )  ->  ( suc  M  \  { M } )  e. 
om )
2928adantr 276 . . . . . 6  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  ( suc  M  \  { M } )  e.  om )
30 dff1o2 5619 . . . . . . . . 9  |-  ( f : suc  M -1-1-onto-> A  <->  ( f  Fn  suc  M  /\  Fun  `' f  /\  ran  f  =  A ) )
3130simp2bi 1040 . . . . . . . 8  |-  ( f : suc  M -1-1-onto-> A  ->  Fun  `' f )
3231adantl 277 . . . . . . 7  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  Fun  `' f )
33 f1ofo 5621 . . . . . . . . 9  |-  ( f : suc  M -1-1-onto-> A  -> 
f : suc  M -onto-> A )
3433adantl 277 . . . . . . . 8  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  f : suc  M -onto-> A )
35 f1orel 5617 . . . . . . . . . . . 12  |-  ( f : suc  M -1-1-onto-> A  ->  Rel  f )
3635adantl 277 . . . . . . . . . . 11  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  Rel  f )
37 resdm 5077 . . . . . . . . . . 11  |-  ( Rel  f  ->  ( f  |` 
dom  f )  =  f )
3836, 37syl 14 . . . . . . . . . 10  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  (
f  |`  dom  f )  =  f )
39 f1odm 5618 . . . . . . . . . . . 12  |-  ( f : suc  M -1-1-onto-> A  ->  dom  f  =  suc  M )
4039reseq2d 5038 . . . . . . . . . . 11  |-  ( f : suc  M -1-1-onto-> A  -> 
( f  |`  dom  f
)  =  ( f  |`  suc  M ) )
4140adantl 277 . . . . . . . . . 10  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  (
f  |`  dom  f )  =  ( f  |`  suc  M ) )
4238, 41eqtr3d 2267 . . . . . . . . 9  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  f  =  ( f  |`  suc  M ) )
43 foeq1 5586 . . . . . . . . 9  |-  ( f  =  ( f  |`  suc  M )  ->  (
f : suc  M -onto-> A 
<->  ( f  |`  suc  M
) : suc  M -onto-> A ) )
4442, 43syl 14 . . . . . . . 8  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  (
f : suc  M -onto-> A 
<->  ( f  |`  suc  M
) : suc  M -onto-> A ) )
4534, 44mpbid 147 . . . . . . 7  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  (
f  |`  suc  M ) : suc  M -onto-> A
)
46 simpl1 1027 . . . . . . . . . 10  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  M  e.  om )
47 f1osng 5657 . . . . . . . . . 10  |-  ( ( M  e.  om  /\  ( f `  M
)  e.  A )  ->  { <. M , 
( f `  M
) >. } : { M } -1-1-onto-> { ( f `  M ) } )
4846, 18, 47syl2anc 411 . . . . . . . . 9  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  { <. M ,  ( f `  M ) >. } : { M } -1-1-onto-> { ( f `  M ) } )
49 f1ofo 5621 . . . . . . . . 9  |-  ( {
<. M ,  ( f `
 M ) >. } : { M } -1-1-onto-> {
( f `  M
) }  ->  { <. M ,  ( f `  M ) >. } : { M } -onto-> { ( f `  M ) } )
5048, 49syl 14 . . . . . . . 8  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  { <. M ,  ( f `  M ) >. } : { M } -onto-> { ( f `  M ) } )
51 f1ofn 5615 . . . . . . . . . . 11  |-  ( f : suc  M -1-1-onto-> A  -> 
f  Fn  suc  M
)
5251adantl 277 . . . . . . . . . 10  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  f  Fn  suc  M )
53 fnressn 5870 . . . . . . . . . 10  |-  ( ( f  Fn  suc  M  /\  M  e.  suc  M )  ->  ( f  |` 
{ M } )  =  { <. M , 
( f `  M
) >. } )
5452, 17, 53syl2anc 411 . . . . . . . . 9  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  (
f  |`  { M }
)  =  { <. M ,  ( f `  M ) >. } )
55 foeq1 5586 . . . . . . . . 9  |-  ( ( f  |`  { M } )  =  { <. M ,  ( f `
 M ) >. }  ->  ( ( f  |`  { M } ) : { M } -onto-> { ( f `  M ) }  <->  { <. M , 
( f `  M
) >. } : { M } -onto-> { ( f `  M ) } ) )
5654, 55syl 14 . . . . . . . 8  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  (
( f  |`  { M } ) : { M } -onto-> { ( f `  M ) }  <->  { <. M , 
( f `  M
) >. } : { M } -onto-> { ( f `  M ) } ) )
5750, 56mpbird 167 . . . . . . 7  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  (
f  |`  { M }
) : { M } -onto-> { ( f `  M ) } )
58 resdif 5636 . . . . . . 7  |-  ( ( Fun  `' f  /\  ( f  |`  suc  M
) : suc  M -onto-> A  /\  ( f  |`  { M } ) : { M } -onto-> {
( f `  M
) } )  -> 
( f  |`  ( suc  M  \  { M } ) ) : ( suc  M  \  { M } ) -1-1-onto-> ( A 
\  { ( f `
 M ) } ) )
5932, 45, 57, 58syl3anc 1274 . . . . . 6  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  (
f  |`  ( suc  M  \  { M } ) ) : ( suc 
M  \  { M } ) -1-1-onto-> ( A  \  {
( f `  M
) } ) )
60 f1oeng 6996 . . . . . 6  |-  ( ( ( suc  M  \  { M } )  e. 
om  /\  ( f  |`  ( suc  M  \  { M } ) ) : ( suc  M  \  { M } ) -1-1-onto-> ( A  \  { ( f `  M ) } ) )  -> 
( suc  M  \  { M } )  ~~  ( A  \  { ( f `
 M ) } ) )
6129, 59, 60syl2anc 411 . . . . 5  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  ( suc  M  \  { M } )  ~~  ( A  \  { ( f `
 M ) } ) )
6225, 61eqbrtrd 4131 . . . 4  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  M  ~~  ( A  \  {
( f `  M
) } ) )
6362ensymd 7023 . . 3  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  ( A  \  { ( f `
 M ) } )  ~~  M )
64 entr 7024 . . 3  |-  ( ( ( A  \  { X } )  ~~  ( A  \  { ( f `
 M ) } )  /\  ( A 
\  { ( f `
 M ) } )  ~~  M )  ->  ( A  \  { X } )  ~~  M )
6520, 63, 64syl2anc 411 . 2  |-  ( ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A
)  /\  f : suc  M -1-1-onto-> A )  ->  ( A  \  { X }
)  ~~  M )
664, 65exlimddv 1948 1  |-  ( ( M  e.  om  /\  A  ~~  suc  M  /\  X  e.  A )  ->  ( A  \  { X } )  ~~  M
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398   E.wex 1541    e. wcel 2203    \ cdif 3208   {csn 3689   <.cop 3692   class class class wbr 4109   Ord word 4483   suc csuc 4486   omcom 4712   `'ccnv 4748   dom cdm 4749   ran crn 4750    |` cres 4751   Rel wrel 4754   Fun wfun 5346    Fn wfn 5347   -->wf 5348   -onto->wfo 5350   -1-1-onto->wf1o 5351   ` cfv 5352    ~~ cen 6973   Fincfn 6975
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 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710
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 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-if 3621  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-er 6767  df-en 6976  df-fin 6978
This theorem is referenced by:  dif1enen  7137  findcard  7145  findcard2  7146  findcard2s  7147  diffisn  7150  en2eleq  7498  en2other2  7499  zfz1isolem1  11212
  Copyright terms: Public domain W3C validator