| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > reusv2lem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for reusv2 5350. (Contributed by NM, 22-Oct-2010.) (Proof shortened by Mario Carneiro, 19-Nov-2016.) |
| Ref | Expression |
|---|---|
| reusv2lem1 | ⊢ (𝐴 ≠ ∅ → (∃!𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∃𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0 4307 | . . 3 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐴) | |
| 2 | nfra1 3262 | . . . . 5 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐴 𝑥 = 𝐵 | |
| 3 | 2 | nfmov 2561 | . . . 4 ⊢ Ⅎ𝑦∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 |
| 4 | rsp 3226 | . . . . . . 7 ⊢ (∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → (𝑦 ∈ 𝐴 → 𝑥 = 𝐵)) | |
| 5 | 4 | com12 32 | . . . . . 6 ⊢ (𝑦 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → 𝑥 = 𝐵)) |
| 6 | 5 | alrimiv 1929 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥(∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → 𝑥 = 𝐵)) |
| 7 | mo2icl 3674 | . . . . 5 ⊢ (∀𝑥(∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → 𝑥 = 𝐵) → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) | |
| 8 | 6, 7 | syl 17 | . . . 4 ⊢ (𝑦 ∈ 𝐴 → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) |
| 9 | 3, 8 | exlimi 2225 | . . 3 ⊢ (∃𝑦 𝑦 ∈ 𝐴 → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) |
| 10 | 1, 9 | sylbi 217 | . 2 ⊢ (𝐴 ≠ ∅ → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) |
| 11 | df-eu 2570 | . . 3 ⊢ (∃!𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ (∃𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ∧ ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) | |
| 12 | 11 | rbaib 538 | . 2 ⊢ (∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → (∃!𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∃𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
| 13 | 10, 12 | syl 17 | 1 ⊢ (𝐴 ≠ ∅ → (∃!𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∃𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∀wal 1540 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ∃*wmo 2538 ∃!weu 2569 ≠ wne 2933 ∀wral 3052 ∅c0 4287 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-v 3444 df-dif 3906 df-nul 4288 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |