![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ackbij1lem2 | Structured version Visualization version GIF version |
Description: Lemma for ackbij2 10264. (Contributed by Stefan O'Rear, 18-Nov-2014.) |
Ref | Expression |
---|---|
ackbij1lem2 | ⊢ (𝐴 ∈ 𝐵 → (𝐵 ∩ suc 𝐴) = ({𝐴} ∪ (𝐵 ∩ 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-suc 6368 | . . . 4 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
2 | 1 | ineq2i 4201 | . . 3 ⊢ (𝐵 ∩ suc 𝐴) = (𝐵 ∩ (𝐴 ∪ {𝐴})) |
3 | indi 4266 | . . 3 ⊢ (𝐵 ∩ (𝐴 ∪ {𝐴})) = ((𝐵 ∩ 𝐴) ∪ (𝐵 ∩ {𝐴})) | |
4 | uncom 4144 | . . 3 ⊢ ((𝐵 ∩ 𝐴) ∪ (𝐵 ∩ {𝐴})) = ((𝐵 ∩ {𝐴}) ∪ (𝐵 ∩ 𝐴)) | |
5 | 2, 3, 4 | 3eqtri 2757 | . 2 ⊢ (𝐵 ∩ suc 𝐴) = ((𝐵 ∩ {𝐴}) ∪ (𝐵 ∩ 𝐴)) |
6 | snssi 4805 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → {𝐴} ⊆ 𝐵) | |
7 | sseqin2 4207 | . . . 4 ⊢ ({𝐴} ⊆ 𝐵 ↔ (𝐵 ∩ {𝐴}) = {𝐴}) | |
8 | 6, 7 | sylib 217 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (𝐵 ∩ {𝐴}) = {𝐴}) |
9 | 8 | uneq1d 4153 | . 2 ⊢ (𝐴 ∈ 𝐵 → ((𝐵 ∩ {𝐴}) ∪ (𝐵 ∩ 𝐴)) = ({𝐴} ∪ (𝐵 ∩ 𝐴))) |
10 | 5, 9 | eqtrid 2777 | 1 ⊢ (𝐴 ∈ 𝐵 → (𝐵 ∩ suc 𝐴) = ({𝐴} ∪ (𝐵 ∩ 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2098 ∪ cun 3937 ∩ cin 3938 ⊆ wss 3939 {csn 4622 suc csuc 6364 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2696 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-tru 1536 df-ex 1774 df-sb 2060 df-clab 2703 df-cleq 2717 df-clel 2802 df-rab 3420 df-v 3465 df-un 3944 df-in 3946 df-ss 3956 df-sn 4623 df-suc 6368 |
This theorem is referenced by: ackbij1lem15 10255 ackbij1lem16 10256 |
Copyright terms: Public domain | W3C validator |