| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eusvobj1 | Structured version Visualization version GIF version | ||
| Description: Specify the same object in two ways when class 𝐵(𝑦) is single-valued. (Contributed by NM, 1-Nov-2010.) (Proof shortened by Mario Carneiro, 19-Nov-2016.) |
| Ref | Expression |
|---|---|
| eusvobj1.1 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| eusvobj1 | ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → (℩𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵) = (℩𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfeu1 2614 | . . 3 ⊢ Ⅎ𝑥∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 | |
| 2 | eusvobj1.1 | . . . 4 ⊢ 𝐵 ∈ V | |
| 3 | 2 | eusvobj2 7412 | . . 3 ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → (∃𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
| 4 | 1, 3 | alrimi 2249 | . 2 ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → ∀𝑥(∃𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
| 5 | iotabi 6507 | . 2 ⊢ (∀𝑥(∃𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑥 = 𝐵) → (℩𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵) = (℩𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) | |
| 6 | 4, 5 | syl 18 | 1 ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → (℩𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵) = (℩𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1567 = wceq 1569 ∈ wcel 2144 ∃!weu 2593 ∀wral 3076 ∃wrex 3086 Vcvv 3450 ℩cio 6492 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-nul 4279 df-sn 4585 df-uni 4867 df-iota 6494 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |