Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ackbij1lem2 Structured version   Visualization version   GIF version

Theorem ackbij1lem2 8990
 Description: Lemma for ackbij2 9012. (Contributed by Stefan O'Rear, 18-Nov-2014.)
Assertion
Ref Expression
ackbij1lem2 (𝐴𝐵 → (𝐵 ∩ suc 𝐴) = ({𝐴} ∪ (𝐵𝐴)))

Proof of Theorem ackbij1lem2
StepHypRef Expression
1 df-suc 5690 . . . 4 suc 𝐴 = (𝐴 ∪ {𝐴})
21ineq2i 3791 . . 3 (𝐵 ∩ suc 𝐴) = (𝐵 ∩ (𝐴 ∪ {𝐴}))
3 indi 3851 . . 3 (𝐵 ∩ (𝐴 ∪ {𝐴})) = ((𝐵𝐴) ∪ (𝐵 ∩ {𝐴}))
4 uncom 3737 . . 3 ((𝐵𝐴) ∪ (𝐵 ∩ {𝐴})) = ((𝐵 ∩ {𝐴}) ∪ (𝐵𝐴))
52, 3, 43eqtri 2647 . 2 (𝐵 ∩ suc 𝐴) = ((𝐵 ∩ {𝐴}) ∪ (𝐵𝐴))
6 snssi 4310 . . . 4 (𝐴𝐵 → {𝐴} ⊆ 𝐵)
7 sseqin2 3797 . . . 4 ({𝐴} ⊆ 𝐵 ↔ (𝐵 ∩ {𝐴}) = {𝐴})
86, 7sylib 208 . . 3 (𝐴𝐵 → (𝐵 ∩ {𝐴}) = {𝐴})
98uneq1d 3746 . 2 (𝐴𝐵 → ((𝐵 ∩ {𝐴}) ∪ (𝐵𝐴)) = ({𝐴} ∪ (𝐵𝐴)))
105, 9syl5eq 2667 1 (𝐴𝐵 → (𝐵 ∩ suc 𝐴) = ({𝐴} ∪ (𝐵𝐴)))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1480   ∈ wcel 1987   ∪ cun 3554   ∩ cin 3555   ⊆ wss 3556  {csn 4150  suc csuc 5686 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-v 3188  df-un 3561  df-in 3563  df-ss 3570  df-sn 4151  df-suc 5690 This theorem is referenced by:  ackbij1lem15  9003  ackbij1lem16  9004
 Copyright terms: Public domain W3C validator