| Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > eu2ndop1stv | Structured version Visualization version GIF version | ||
| Description: If there is a unique second component in an ordered pair contained in a given set, the first component must be a set. (Contributed by Alexander van der Vekens, 29-Nov-2017.) |
| Ref | Expression |
|---|---|
| eu2ndop1stv | ⊢ (∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉 → 𝐴 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | euex 2605 | . 2 ⊢ (∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉 → ∃𝑦〈𝐴, 𝑦〉 ∈ 𝑉) | |
| 2 | nfeu1 2617 | . . . 4 ⊢ Ⅎ𝑦∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉 | |
| 3 | nfcv 2926 | . . . . 5 ⊢ Ⅎ𝑦𝐴 | |
| 4 | 3 | nfel1 2942 | . . . 4 ⊢ Ⅎ𝑦 𝐴 ∈ V |
| 5 | 2, 4 | nfim 1931 | . . 3 ⊢ Ⅎ𝑦(∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉 → 𝐴 ∈ V) |
| 6 | opprc1 4858 | . . . . . . . . 9 ⊢ (¬ 𝐴 ∈ V → 〈𝐴, 𝑦〉 = ∅) | |
| 7 | 6 | eleq1d 2849 | . . . . . . . 8 ⊢ (¬ 𝐴 ∈ V → (〈𝐴, 𝑦〉 ∈ 𝑉 ↔ ∅ ∈ 𝑉)) |
| 8 | ax-5 1945 | . . . . . . . . 9 ⊢ (∅ ∈ 𝑉 → ∀𝑦∅ ∈ 𝑉) | |
| 9 | alneu 48397 | . . . . . . . . 9 ⊢ (∀𝑦∅ ∈ 𝑉 → ¬ ∃!𝑦∅ ∈ 𝑉) | |
| 10 | 8, 9 | syl 18 | . . . . . . . 8 ⊢ (∅ ∈ 𝑉 → ¬ ∃!𝑦∅ ∈ 𝑉) |
| 11 | 7, 10 | biimtrdi 256 | . . . . . . 7 ⊢ (¬ 𝐴 ∈ V → (〈𝐴, 𝑦〉 ∈ 𝑉 → ¬ ∃!𝑦∅ ∈ 𝑉)) |
| 12 | 11 | impcom 413 | . . . . . 6 ⊢ ((〈𝐴, 𝑦〉 ∈ 𝑉 ∧ ¬ 𝐴 ∈ V) → ¬ ∃!𝑦∅ ∈ 𝑉) |
| 13 | 7 | eubidv 2614 | . . . . . . . 8 ⊢ (¬ 𝐴 ∈ V → (∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉 ↔ ∃!𝑦∅ ∈ 𝑉)) |
| 14 | 13 | notbid 321 | . . . . . . 7 ⊢ (¬ 𝐴 ∈ V → (¬ ∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉 ↔ ¬ ∃!𝑦∅ ∈ 𝑉)) |
| 15 | 14 | adantl 487 | . . . . . 6 ⊢ ((〈𝐴, 𝑦〉 ∈ 𝑉 ∧ ¬ 𝐴 ∈ V) → (¬ ∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉 ↔ ¬ ∃!𝑦∅ ∈ 𝑉)) |
| 16 | 12, 15 | mpbird 260 | . . . . 5 ⊢ ((〈𝐴, 𝑦〉 ∈ 𝑉 ∧ ¬ 𝐴 ∈ V) → ¬ ∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉) |
| 17 | 16 | ex 418 | . . . 4 ⊢ (〈𝐴, 𝑦〉 ∈ 𝑉 → (¬ 𝐴 ∈ V → ¬ ∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉)) |
| 18 | 17 | con4d 116 | . . 3 ⊢ (〈𝐴, 𝑦〉 ∈ 𝑉 → (∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉 → 𝐴 ∈ V)) |
| 19 | 5, 18 | exlimi 2257 | . 2 ⊢ (∃𝑦〈𝐴, 𝑦〉 ∈ 𝑉 → (∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉 → 𝐴 ∈ V)) |
| 20 | 1, 19 | mpcom 39 | 1 ⊢ (∃!𝑦〈𝐴, 𝑦〉 ∈ 𝑉 → 𝐴 ∈ V) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1568 ∃wex 1812 ∈ wcel 2147 ∃!weu 2596 Vcvv 3454 ∅c0 4281 〈cop 4838 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-nul 5263 ax-pow 5331 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ss 3901 df-dif 4050 df-nul 4282 df-if 4486 df-op 4839 |
| This theorem is used by: afveu 48426 tz6.12-afv 48446 tz6.12-afv2 48513 |
| Copyright terms: Public domain | W3C validator |