| 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 9239. (Contributed by Mario Carneiro, 5-Jan-2016.) |
| Ref | Expression |
|---|---|
| enp1ilem.1 | ⊢ 𝑇 = ({𝑥} ∪ 𝑆) |
| Ref | Expression |
|---|---|
| enp1ilem | ⊢ (𝑥 ∈ 𝐴 → ((𝐴 ∖ {𝑥}) = 𝑆 → 𝐴 = 𝑇)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uneq1 4123 | . . 3 ⊢ ((𝐴 ∖ {𝑥}) = 𝑆 → ((𝐴 ∖ {𝑥}) ∪ {𝑥}) = (𝑆 ∪ {𝑥})) | |
| 2 | undif1 4442 | . . 3 ⊢ ((𝐴 ∖ {𝑥}) ∪ {𝑥}) = (𝐴 ∪ {𝑥}) | |
| 3 | uncom 4120 | . . . 4 ⊢ (𝑆 ∪ {𝑥}) = ({𝑥} ∪ 𝑆) | |
| 4 | enp1ilem.1 | . . . 4 ⊢ 𝑇 = ({𝑥} ∪ 𝑆) | |
| 5 | 3, 4 | eqtr4i 2795 | . . 3 ⊢ (𝑆 ∪ {𝑥}) = 𝑇 |
| 6 | 1, 2, 5 | 3eqtr3g 2827 | . 2 ⊢ ((𝐴 ∖ {𝑥}) = 𝑆 → (𝐴 ∪ {𝑥}) = 𝑇) |
| 7 | snssi 4756 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → {𝑥} ⊆ 𝐴) | |
| 8 | ssequn2 4150 | . . . 4 ⊢ ({𝑥} ⊆ 𝐴 ↔ (𝐴 ∪ {𝑥}) = 𝐴) | |
| 9 | 7, 8 | sylib 221 | . . 3 ⊢ (𝑥 ∈ 𝐴 → (𝐴 ∪ {𝑥}) = 𝐴) |
| 10 | 9 | eqeq1d 2771 | . 2 ⊢ (𝑥 ∈ 𝐴 → ((𝐴 ∪ {𝑥}) = 𝑇 ↔ 𝐴 = 𝑇)) |
| 11 | 6, 10 | imbitrid 247 | 1 ⊢ (𝑥 ∈ 𝐴 → ((𝐴 ∖ {𝑥}) = 𝑆 → 𝐴 = 𝑇)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 ∖ cdif 3910 ∪ cun 3911 ⊆ wss 3913 {csn 4594 |
| 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-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-sn 4595 |
| This theorem is referenced by: en2 9240 en3 9241 en4 9242 |
| Copyright terms: Public domain | W3C validator |