| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uniopel | Structured version Visualization version GIF version | ||
| Description: Ordered pair membership is inherited by class union. (Contributed by NM, 13-May-2008.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| opthw.1 | ⊢ 𝐴 ∈ V |
| opthw.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| uniopel | ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → ∪ 〈𝐴, 𝐵〉 ∈ ∪ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opthw.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 2 | opthw.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 3 | 1, 2 | uniop 5500 | . . 3 ⊢ ∪ 〈𝐴, 𝐵〉 = {𝐴, 𝐵} |
| 4 | 1, 2 | opi2 5453 | . . 3 ⊢ {𝐴, 𝐵} ∈ 〈𝐴, 𝐵〉 |
| 5 | 3, 4 | eqeltri 2861 | . 2 ⊢ ∪ 〈𝐴, 𝐵〉 ∈ 〈𝐴, 𝐵〉 |
| 6 | elssuni 4906 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → 〈𝐴, 𝐵〉 ⊆ ∪ 𝐶) | |
| 7 | 6 | sseld 3937 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → (∪ 〈𝐴, 𝐵〉 ∈ 〈𝐴, 𝐵〉 → ∪ 〈𝐴, 𝐵〉 ∈ ∪ 𝐶)) |
| 8 | 5, 7 | mpi 21 | 1 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → ∪ 〈𝐴, 𝐵〉 ∈ ∪ 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ wcel 2146 Vcvv 3457 {cpr 4593 〈cop 4597 ∪ cuni 4874 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 ax-sep 5259 ax-pr 5406 |
| 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-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 |
| This theorem is used by: dmrnssfld 5966 unielrel 6278 |
| Copyright terms: Public domain | W3C validator |