| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elvvuni | Structured version Visualization version GIF version | ||
| Description: An ordered pair contains its union. (Contributed by NM, 16-Sep-2006.) |
| Ref | Expression |
|---|---|
| elvvuni | ⊢ (𝐴 ∈ (V × V) → ∪ 𝐴 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elvv 5693 | . 2 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) | |
| 2 | vex 3435 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 3 | vex 3435 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 4 | 2, 3 | uniop 5456 | . . . . 5 ⊢ ∪ 〈𝑥, 𝑦〉 = {𝑥, 𝑦} |
| 5 | 2, 3 | opi2 5409 | . . . . 5 ⊢ {𝑥, 𝑦} ∈ 〈𝑥, 𝑦〉 |
| 6 | 4, 5 | eqeltri 2835 | . . . 4 ⊢ ∪ 〈𝑥, 𝑦〉 ∈ 〈𝑥, 𝑦〉 |
| 7 | unieq 4849 | . . . . 5 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 = ∪ 〈𝑥, 𝑦〉) | |
| 8 | id 22 | . . . . 5 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → 𝐴 = 〈𝑥, 𝑦〉) | |
| 9 | 7, 8 | eleq12d 2833 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (∪ 𝐴 ∈ 𝐴 ↔ ∪ 〈𝑥, 𝑦〉 ∈ 〈𝑥, 𝑦〉)) |
| 10 | 6, 9 | mpbiri 259 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 ∈ 𝐴) |
| 11 | 10 | exlimivv 1939 | . 2 ⊢ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 ∈ 𝐴) |
| 12 | 1, 11 | sylbi 218 | 1 ⊢ (𝐴 ∈ (V × V) → ∪ 𝐴 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∃wex 1786 ∈ wcel 2119 Vcvv 3431 {cpr 4557 〈cop 4561 ∪ cuni 4838 × cxp 5616 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-sep 5218 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-opab 5135 df-xp 5624 |
| This theorem is referenced by: unielxp 7969 |
| Copyright terms: Public domain | W3C validator |