Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > reusv2lem1 | Structured version Visualization version GIF version |
Description: Lemma for reusv2 5296. (Contributed by NM, 22-Oct-2010.) (Proof shortened by Mario Carneiro, 19-Nov-2016.) |
Ref | Expression |
---|---|
reusv2lem1 | ⊢ (𝐴 ≠ ∅ → (∃!𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∃𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | n0 4261 | . . 3 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐴) | |
2 | nfra1 3140 | . . . . 5 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐴 𝑥 = 𝐵 | |
3 | 2 | nfmov 2559 | . . . 4 ⊢ Ⅎ𝑦∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 |
4 | rsp 3127 | . . . . . . 7 ⊢ (∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → (𝑦 ∈ 𝐴 → 𝑥 = 𝐵)) | |
5 | 4 | com12 32 | . . . . . 6 ⊢ (𝑦 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → 𝑥 = 𝐵)) |
6 | 5 | alrimiv 1935 | . . . . 5 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥(∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → 𝑥 = 𝐵)) |
7 | mo2icl 3627 | . . . . 5 ⊢ (∀𝑥(∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → 𝑥 = 𝐵) → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) | |
8 | 6, 7 | syl 17 | . . . 4 ⊢ (𝑦 ∈ 𝐴 → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) |
9 | 3, 8 | exlimi 2215 | . . 3 ⊢ (∃𝑦 𝑦 ∈ 𝐴 → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) |
10 | 1, 9 | sylbi 220 | . 2 ⊢ (𝐴 ≠ ∅ → ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵) |
11 | df-eu 2568 | . . 3 ⊢ (∃!𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ (∃𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ∧ ∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) | |
12 | 11 | rbaib 542 | . 2 ⊢ (∃*𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 → (∃!𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∃𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
13 | 10, 12 | syl 17 | 1 ⊢ (𝐴 ≠ ∅ → (∃!𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∃𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∀wal 1541 = wceq 1543 ∃wex 1787 ∈ wcel 2110 ∃*wmo 2537 ∃!weu 2567 ≠ wne 2940 ∀wral 3061 ∅c0 4237 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2708 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2816 df-ne 2941 df-ral 3066 df-v 3410 df-dif 3869 df-nul 4238 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |