![]() |
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 5590 | . 2 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) | |
2 | vex 3444 | . . . . . 6 ⊢ 𝑥 ∈ V | |
3 | vex 3444 | . . . . . 6 ⊢ 𝑦 ∈ V | |
4 | 2, 3 | uniop 5370 | . . . . 5 ⊢ ∪ 〈𝑥, 𝑦〉 = {𝑥, 𝑦} |
5 | 2, 3 | opi2 5326 | . . . . 5 ⊢ {𝑥, 𝑦} ∈ 〈𝑥, 𝑦〉 |
6 | 4, 5 | eqeltri 2886 | . . . 4 ⊢ ∪ 〈𝑥, 𝑦〉 ∈ 〈𝑥, 𝑦〉 |
7 | unieq 4811 | . . . . 5 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 = ∪ 〈𝑥, 𝑦〉) | |
8 | id 22 | . . . . 5 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → 𝐴 = 〈𝑥, 𝑦〉) | |
9 | 7, 8 | eleq12d 2884 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (∪ 𝐴 ∈ 𝐴 ↔ ∪ 〈𝑥, 𝑦〉 ∈ 〈𝑥, 𝑦〉)) |
10 | 6, 9 | mpbiri 261 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 ∈ 𝐴) |
11 | 10 | exlimivv 1933 | . 2 ⊢ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 ∈ 𝐴) |
12 | 1, 11 | sylbi 220 | 1 ⊢ (𝐴 ∈ (V × V) → ∪ 𝐴 ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∃wex 1781 ∈ wcel 2111 Vcvv 3441 {cpr 4527 〈cop 4531 ∪ cuni 4800 × cxp 5517 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-opab 5093 df-xp 5525 |
This theorem is referenced by: unielxp 7709 |
Copyright terms: Public domain | W3C validator |