| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ackbij1lem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for ackbij2 10225. (Contributed by Stefan O'Rear, 18-Nov-2014.) |
| Ref | Expression |
|---|---|
| ackbij1lem1 | ⊢ (¬ 𝐴 ∈ 𝐵 → (𝐵 ∩ suc 𝐴) = (𝐵 ∩ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-suc 6367 | . . . 4 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 2 | 1 | ineq2i 4178 | . . 3 ⊢ (𝐵 ∩ suc 𝐴) = (𝐵 ∩ (𝐴 ∪ {𝐴})) |
| 3 | indi 4245 | . . 3 ⊢ (𝐵 ∩ (𝐴 ∪ {𝐴})) = ((𝐵 ∩ 𝐴) ∪ (𝐵 ∩ {𝐴})) | |
| 4 | 2, 3 | eqtri 2792 | . 2 ⊢ (𝐵 ∩ suc 𝐴) = ((𝐵 ∩ 𝐴) ∪ (𝐵 ∩ {𝐴})) |
| 5 | disjsn 4682 | . . . . 5 ⊢ ((𝐵 ∩ {𝐴}) = ∅ ↔ ¬ 𝐴 ∈ 𝐵) | |
| 6 | 5 | biimpri 231 | . . . 4 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝐵 ∩ {𝐴}) = ∅) |
| 7 | 6 | uneq2d 4130 | . . 3 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝐵 ∩ 𝐴) ∪ (𝐵 ∩ {𝐴})) = ((𝐵 ∩ 𝐴) ∪ ∅)) |
| 8 | un0 4358 | . . 3 ⊢ ((𝐵 ∩ 𝐴) ∪ ∅) = (𝐵 ∩ 𝐴) | |
| 9 | 7, 8 | eqtrdi 2820 | . 2 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝐵 ∩ 𝐴) ∪ (𝐵 ∩ {𝐴})) = (𝐵 ∩ 𝐴)) |
| 10 | 4, 9 | eqtrid 2816 | 1 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝐵 ∩ suc 𝐴) = (𝐵 ∩ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1567 ∈ wcel 2149 ∪ cun 3911 ∩ cin 3912 ∅c0 4294 {csn 4594 suc csuc 6363 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-nul 4295 df-sn 4595 df-suc 6367 |
| This theorem is referenced by: ackbij1lem15 10216 ackbij1lem16 10217 |
| Copyright terms: Public domain | W3C validator |