Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > reusv2lem1 | Structured version Visualization version GIF version |
Description: Lemma for reusv2 5294. (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 3216 | . . . . 5 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐴 𝑥 = 𝐵 | |
3 | 2 | nfmov 2637 | . . . 4 ⊢ Ⅎ𝑦∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 |
4 | rsp 3202 | . . . . . . 7 ⊢ (∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → (𝑦 ∈ 𝐴 → 𝑥 = 𝐵)) | |
5 | 4 | com12 32 | . . . . . 6 ⊢ (𝑦 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → 𝑥 = 𝐵)) |
6 | 5 | alrimiv 1919 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥(∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → 𝑥 = 𝐵)) |
7 | mo2icl 3702 | . . . . 5 ⊢ (∀𝑥(∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → 𝑥 = 𝐵) → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) | |
8 | 6, 7 | syl 17 | . . . 4 ⊢ (𝑦 ∈ 𝐴 → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) |
9 | 3, 8 | exlimi 2207 | . . 3 ⊢ (∃𝑦 𝑦 ∈ 𝐴 → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) |
10 | 1, 9 | sylbi 218 | . 2 ⊢ (𝐴 ≠ ∅ → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) |
11 | df-eu 2647 | . . 3 ⊢ (∃!𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ (∃𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ∧ ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) | |
12 | 11 | rbaib 539 | . 2 ⊢ (∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → (∃!𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∃𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
13 | 10, 12 | syl 17 | 1 ⊢ (𝐴 ≠ ∅ → (∃!𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∃𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∀wal 1526 = wceq 1528 ∃wex 1771 ∈ wcel 2105 ∃*wmo 2613 ∃!weu 2646 ≠ wne 3013 ∀wral 3135 ∅c0 4288 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-v 3494 df-dif 3936 df-nul 4289 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |