| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opeluu | Structured version Visualization version GIF version | ||
| Description: Each member of an ordered pair belongs to the union of the union of a class to which the ordered pair belongs. Lemma 3D of [Enderton] p. 41. (Contributed by NM, 31-Mar-1995.) (Revised by Mario Carneiro, 27-Feb-2016.) |
| Ref | Expression |
|---|---|
| opeluu.1 | ⊢ 𝐴 ∈ V |
| opeluu.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| opeluu | ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → (𝐴 ∈ ∪ ∪ 𝐶 ∧ 𝐵 ∈ ∪ ∪ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opeluu.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 2 | 1 | prid1 4726 | . . 3 ⊢ 𝐴 ∈ {𝐴, 𝐵} |
| 3 | opeluu.2 | . . . . 5 ⊢ 𝐵 ∈ V | |
| 4 | 1, 3 | opi2 5449 | . . . 4 ⊢ {𝐴, 𝐵} ∈ 〈𝐴, 𝐵〉 |
| 5 | elunii 4875 | . . . 4 ⊢ (({𝐴, 𝐵} ∈ 〈𝐴, 𝐵〉 ∧ 〈𝐴, 𝐵〉 ∈ 𝐶) → {𝐴, 𝐵} ∈ ∪ 𝐶) | |
| 6 | 4, 5 | mpan 703 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → {𝐴, 𝐵} ∈ ∪ 𝐶) |
| 7 | elunii 4875 | . . 3 ⊢ ((𝐴 ∈ {𝐴, 𝐵} ∧ {𝐴, 𝐵} ∈ ∪ 𝐶) → 𝐴 ∈ ∪ ∪ 𝐶) | |
| 8 | 2, 6, 7 | sylancr 599 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → 𝐴 ∈ ∪ ∪ 𝐶) |
| 9 | 3 | prid2 4727 | . . 3 ⊢ 𝐵 ∈ {𝐴, 𝐵} |
| 10 | elunii 4875 | . . 3 ⊢ ((𝐵 ∈ {𝐴, 𝐵} ∧ {𝐴, 𝐵} ∈ ∪ 𝐶) → 𝐵 ∈ ∪ ∪ 𝐶) | |
| 11 | 9, 6, 10 | sylancr 599 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → 𝐵 ∈ ∪ ∪ 𝐶) |
| 12 | 8, 11 | jca 521 | 1 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → (𝐴 ∈ ∪ ∪ 𝐶 ∧ 𝐵 ∈ ∪ ∪ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∈ wcel 2145 Vcvv 3453 {cpr 4589 〈cop 4593 ∪ cuni 4870 |
| 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 2147 ax-9 2155 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| 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 2741 df-cleq 2754 df-clel 2837 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 |
| This theorem is used by: asymref 6114 asymref2 6115 wrdexb 14592 |
| Copyright terms: Public domain | W3C validator |