| 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 4735 | . 2 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) | |
| 2 | vex 2774 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 3 | vex 2774 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 4 | 2, 3 | uniop 4298 | . . . . 5 ⊢ ∪ 〈𝑥, 𝑦〉 = {𝑥, 𝑦} |
| 5 | 2, 3 | opi2 4276 | . . . . 5 ⊢ {𝑥, 𝑦} ∈ 〈𝑥, 𝑦〉 |
| 6 | 4, 5 | eqeltri 2277 | . . . 4 ⊢ ∪ 〈𝑥, 𝑦〉 ∈ 〈𝑥, 𝑦〉 |
| 7 | unieq 3858 | . . . . 5 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 = ∪ 〈𝑥, 𝑦〉) | |
| 8 | id 19 | . . . . 5 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → 𝐴 = 〈𝑥, 𝑦〉) | |
| 9 | 7, 8 | eleq12d 2275 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (∪ 𝐴 ∈ 𝐴 ↔ ∪ 〈𝑥, 𝑦〉 ∈ 〈𝑥, 𝑦〉)) |
| 10 | 6, 9 | mpbiri 168 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 ∈ 𝐴) |
| 11 | 10 | exlimivv 1919 | . 2 ⊢ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 → ∪ 𝐴 ∈ 𝐴) |
| 12 | 1, 11 | sylbi 121 | 1 ⊢ (𝐴 ∈ (V × V) → ∪ 𝐴 ∈ 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1372 ∃wex 1514 ∈ wcel 2175 Vcvv 2771 {cpr 3633 〈cop 3635 ∪ cuni 3849 × cxp 4671 |
| 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 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-pow 4217 ax-pr 4252 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-nf 1483 df-sb 1785 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-rex 2489 df-v 2773 df-un 3169 df-in 3171 df-ss 3178 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-opab 4105 df-xp 4679 |
| This theorem is referenced by: unielxp 6250 |
| Copyright terms: Public domain | W3C validator |