| 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 9235. (Contributed by Mario Carneiro, 5-Jan-2016.) |
| Ref | Expression |
|---|---|
| enp1ilem.1 | ⊢ 𝑇 = ({𝑥} ∪ 𝑆) |
| Ref | Expression |
|---|---|
| enp1ilem | ⊢ (𝑥 ∈ 𝐴 → ((𝐴 ∖ {𝑥}) = 𝑆 → 𝐴 = 𝑇)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uneq1 4115 | . . 3 ⊢ ((𝐴 ∖ {𝑥}) = 𝑆 → ((𝐴 ∖ {𝑥}) ∪ {𝑥}) = (𝑆 ∪ {𝑥})) | |
| 2 | undif1 4437 | . . 3 ⊢ ((𝐴 ∖ {𝑥}) ∪ {𝑥}) = (𝐴 ∪ {𝑥}) | |
| 3 | uncom 4112 | . . . 4 ⊢ (𝑆 ∪ {𝑥}) = ({𝑥} ∪ 𝑆) | |
| 4 | enp1ilem.1 | . . . 4 ⊢ 𝑇 = ({𝑥} ∪ 𝑆) | |
| 5 | 3, 4 | eqtr4i 2789 | . . 3 ⊢ (𝑆 ∪ {𝑥}) = 𝑇 |
| 6 | 1, 2, 5 | 3eqtr3g 2821 | . 2 ⊢ ((𝐴 ∖ {𝑥}) = 𝑆 → (𝐴 ∪ {𝑥}) = 𝑇) |
| 7 | snssi 4751 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴) | |
| 8 | ssequn2 4142 | . . . 4 ⊢ ({𝑥} ⊆ 𝐴 ↔ (𝐴 ∪ {𝑥}) = 𝐴) | |
| 9 | 7, 8 | sylib 221 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐴 ∪ {𝑥}) = 𝐴) |
| 10 | 9 | eqeq1d 2765 | . 2 ⊢ (𝑥 ∈ 𝐴 → ((𝐴 ∪ {𝑥}) = 𝑇 ↔ 𝐴 = 𝑇)) |
| 11 | 6, 10 | imbitrid 247 | 1 ⊢ (𝑥 ∈ 𝐴 → ((𝐴 ∖ {𝑥}) = 𝑆 → 𝐴 = 𝑇)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 ∈ wcel 2143 ∖ cdif 3902 ∪ cun 3903 ⊆ wss 3905 {csn 4589 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-sn 4590 |
| This theorem is referenced by: en2 9236 en3 9237 en4 9238 |
| Copyright terms: Public domain | W3C validator |