MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ackbij1lem1 Unicode version

Theorem ackbij1lem1 8064
Description: Lemma for ackbij2 8087. (Contributed by Stefan O'Rear, 18-Nov-2014.)
Assertion
Ref Expression
ackbij1lem1  |-  ( -.  A  e.  B  -> 
( B  i^i  suc  A )  =  ( B  i^i  A ) )

Proof of Theorem ackbij1lem1
StepHypRef Expression
1 df-suc 4555 . . . 4  |-  suc  A  =  ( A  u.  { A } )
21ineq2i 3507 . . 3  |-  ( B  i^i  suc  A )  =  ( B  i^i  ( A  u.  { A } ) )
3 indi 3555 . . 3  |-  ( B  i^i  ( A  u.  { A } ) )  =  ( ( B  i^i  A )  u.  ( B  i^i  { A } ) )
42, 3eqtri 2432 . 2  |-  ( B  i^i  suc  A )  =  ( ( B  i^i  A )  u.  ( B  i^i  { A } ) )
5 disjsn 3836 . . . . 5  |-  ( ( B  i^i  { A } )  =  (/)  <->  -.  A  e.  B )
65biimpri 198 . . . 4  |-  ( -.  A  e.  B  -> 
( B  i^i  { A } )  =  (/) )
76uneq2d 3469 . . 3  |-  ( -.  A  e.  B  -> 
( ( B  i^i  A )  u.  ( B  i^i  { A }
) )  =  ( ( B  i^i  A
)  u.  (/) ) )
8 un0 3620 . . 3  |-  ( ( B  i^i  A )  u.  (/) )  =  ( B  i^i  A )
97, 8syl6eq 2460 . 2  |-  ( -.  A  e.  B  -> 
( ( B  i^i  A )  u.  ( B  i^i  { A }
) )  =  ( B  i^i  A ) )
104, 9syl5eq 2456 1  |-  ( -.  A  e.  B  -> 
( B  i^i  suc  A )  =  ( B  i^i  A ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    = wceq 1649    e. wcel 1721    u. cun 3286    i^i cin 3287   (/)c0 3596   {csn 3782   suc csuc 4551
This theorem is referenced by:  ackbij1lem15  8078  ackbij1lem16  8079
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2393
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2399  df-cleq 2405  df-clel 2408  df-nfc 2537  df-ral 2679  df-v 2926  df-dif 3291  df-un 3293  df-in 3295  df-nul 3597  df-sn 3788  df-suc 4555
  Copyright terms: Public domain W3C validator