| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > enp1ilem | Structured version Visualization version GIF version | ||
| Description: Lemma for uses of enp1i 9163. (Contributed by Mario Carneiro, 5-Jan-2016.) |
| Ref | Expression |
|---|---|
| enp1ilem.1 | ⊢ 𝑇 = ({𝑥} ∪ 𝑆) |
| Ref | Expression |
|---|---|
| enp1ilem | ⊢ (𝑥 ∈ 𝐴 → ((𝐴 ∖ {𝑥}) = 𝑆 → 𝐴 = 𝑇)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uneq1 4108 | . . 3 ⊢ ((𝐴 ∖ {𝑥}) = 𝑆 → ((𝐴 ∖ {𝑥}) ∪ {𝑥}) = (𝑆 ∪ {𝑥})) | |
| 2 | undif1 4423 | . . 3 ⊢ ((𝐴 ∖ {𝑥}) ∪ {𝑥}) = (𝐴 ∪ {𝑥}) | |
| 3 | uncom 4105 | . . . 4 ⊢ (𝑆 ∪ {𝑥}) = ({𝑥} ∪ 𝑆) | |
| 4 | enp1ilem.1 | . . . 4 ⊢ 𝑇 = ({𝑥} ∪ 𝑆) | |
| 5 | 3, 4 | eqtr4i 2757 | . . 3 ⊢ (𝑆 ∪ {𝑥}) = 𝑇 |
| 6 | 1, 2, 5 | 3eqtr3g 2789 | . 2 ⊢ ((𝐴 ∖ {𝑥}) = 𝑆 → (𝐴 ∪ {𝑥}) = 𝑇) |
| 7 | snssi 4757 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴) | |
| 8 | ssequn2 4136 | . . . 4 ⊢ ({𝑥} ⊆ 𝐴 ↔ (𝐴 ∪ {𝑥}) = 𝐴) | |
| 9 | 7, 8 | sylib 218 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐴 ∪ {𝑥}) = 𝐴) |
| 10 | 9 | eqeq1d 2733 | . 2 ⊢ (𝑥 ∈ 𝐴 → ((𝐴 ∪ {𝑥}) = 𝑇 ↔ 𝐴 = 𝑇)) |
| 11 | 6, 10 | imbitrid 244 | 1 ⊢ (𝑥 ∈ 𝐴 → ((𝐴 ∖ {𝑥}) = 𝑆 → 𝐴 = 𝑇)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2111 ∖ cdif 3894 ∪ cun 3895 ⊆ wss 3897 {csn 4573 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-rab 3396 df-v 3438 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4281 df-sn 4574 |
| This theorem is referenced by: en2 9164 en3 9165 en4 9166 |
| Copyright terms: Public domain | W3C validator |