| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ackbij1lem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for ackbij2 10198. (Contributed by Stefan O'Rear, 18-Nov-2014.) |
| Ref | Expression |
|---|---|
| ackbij1lem1 | ⊢ (¬ 𝐴 ∈ 𝐵 → (𝐵 ∩ suc 𝐴) = (𝐵 ∩ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-suc 6352 | . . . 4 ⊢ suc 𝐴 = (𝐴 ∪ {𝐴}) | |
| 2 | 1 | ineq2i 4169 | . . 3 ⊢ (𝐵 ∩ suc 𝐴) = (𝐵 ∩ (𝐴 ∪ {𝐴})) |
| 3 | indi 4236 | . . 3 ⊢ (𝐵 ∩ (𝐴 ∪ {𝐴})) = ((𝐵 ∩ 𝐴) ∪ (𝐵 ∩ {𝐴})) | |
| 4 | 2, 3 | eqtri 2785 | . 2 ⊢ (𝐵 ∩ suc 𝐴) = ((𝐵 ∩ 𝐴) ∪ (𝐵 ∩ {𝐴})) |
| 5 | disjsn 4670 | . . . . 5 ⊢ ((𝐵 ∩ {𝐴}) = ∅ ↔ ¬ 𝐴 ∈ 𝐵) | |
| 6 | 5 | biimpri 230 | . . . 4 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝐵 ∩ {𝐴}) = ∅) |
| 7 | 6 | uneq2d 4121 | . . 3 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝐵 ∩ 𝐴) ∪ (𝐵 ∩ {𝐴})) = ((𝐵 ∩ 𝐴) ∪ ∅)) |
| 8 | un0 4348 | . . 3 ⊢ ((𝐵 ∩ 𝐴) ∪ ∅) = (𝐵 ∩ 𝐴) | |
| 9 | 7, 8 | eqtrdi 2813 | . 2 ⊢ (¬ 𝐴 ∈ 𝐵 → ((𝐵 ∩ 𝐴) ∪ (𝐵 ∩ {𝐴})) = (𝐵 ∩ 𝐴)) |
| 10 | 4, 9 | eqtrid 2809 | 1 ⊢ (¬ 𝐴 ∈ 𝐵 → (𝐵 ∩ suc 𝐴) = (𝐵 ∩ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1560 ∈ wcel 2142 ∪ cun 3902 ∩ cin 3903 ∅c0 4285 {csn 4582 suc csuc 6348 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3077 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-nul 4286 df-sn 4583 df-suc 6352 |
| This theorem is referenced by: ackbij1lem15 10189 ackbij1lem16 10190 |
| Copyright terms: Public domain | W3C validator |