| 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 2616 | . . 3 ⊢ Ⅎ𝑥∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 | |
| 2 | eusvobj1.1 | . . . 4 ⊢ 𝐵 ∈ V | |
| 3 | 2 | eusvobj2 7409 | . . 3 ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → (∃𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
| 4 | 1, 3 | alrimi 2251 | . 2 ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → ∀𝑥(∃𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
| 5 | iotabi 6506 | . 2 ⊢ (∀𝑥(∃𝑦 ∈ 𝐴 𝑥 = 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑥 = 𝐵) → (℩𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵) = (℩𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) | |
| 6 | 4, 5 | syl 18 | 1 ⊢ (∃!𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵 → (℩𝑥∃𝑦 ∈ 𝐴 𝑥 = 𝐵) = (℩𝑥∀𝑦 ∈ 𝐴 𝑥 = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∀wal 1568 = wceq 1570 ∈ wcel 2145 ∃!weu 2595 ∀wral 3078 ∃wrex 3088 Vcvv 3453 ℩cio 6491 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-ss 3919 df-nul 4283 df-sn 4588 df-uni 4871 df-iota 6493 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |