| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elvvuni | 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 4788 | . 2 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) | |
| 2 | vex 2805 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 3 | vex 2805 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 4 | 2, 3 | uniop 4348 | . . . . 5 ⊢ ∪ 〈𝑥, 𝑦〉 = {𝑥, 𝑦} |
| 5 | 2, 3 | opi2 4325 | . . . . 5 ⊢ {𝑥, 𝑦} ∈ 〈𝑥, 𝑦〉 |
| 6 | 4, 5 | eqeltri 2304 | . . . 4 ⊢ ∪ 〈𝑥, 𝑦〉 ∈ 〈𝑥, 𝑦〉 |
| 7 | unieq 3902 | . . . . 5 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 = ∪ 〈𝑥, 𝑦〉) | |
| 8 | id 19 | . . . . 5 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → 𝐴 = 〈𝑥, 𝑦〉) | |
| 9 | 7, 8 | eleq12d 2302 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (∪ 𝐴 ∈ 𝐴 ↔ ∪ 〈𝑥, 𝑦〉 ∈ 〈𝑥, 𝑦〉)) |
| 10 | 6, 9 | mpbiri 168 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 ∈ 𝐴) |
| 11 | 10 | exlimivv 1945 | . 2 ⊢ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 ∈ 𝐴) |
| 12 | 1, 11 | sylbi 121 | 1 ⊢ (𝐴 ∈ (V × V) → ∪ 𝐴 ∈ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1397 ∃wex 1540 ∈ wcel 2202 Vcvv 2802 {cpr 3670 〈cop 3672 ∪ cuni 3893 × cxp 4723 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-rex 2516 df-v 2804 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-opab 4151 df-xp 4731 |
| This theorem is referenced by: unielxp 6336 |
| Copyright terms: Public domain | W3C validator |