| 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 4701 | . . 3 ⊢ 𝐴 ∈ {𝐴, 𝐵} |
| 3 | opeluu.2 | . . . . 5 ⊢ 𝐵 ∈ V | |
| 4 | 1, 3 | opi2 5416 | . . . 4 ⊢ {𝐴, 𝐵} ∈ 〈𝐴, 𝐵〉 |
| 5 | elunii 4850 | . . . 4 ⊢ (({𝐴, 𝐵} ∈ 〈𝐴, 𝐵〉 ∧ 〈𝐴, 𝐵〉 ∈ 𝐶) → {𝐴, 𝐵} ∈ ∪ 𝐶) | |
| 6 | 4, 5 | mpan 696 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → {𝐴, 𝐵} ∈ ∪ 𝐶) |
| 7 | elunii 4850 | . . 3 ⊢ ((𝐴 ∈ {𝐴, 𝐵} ∧ {𝐴, 𝐵} ∈ ∪ 𝐶) → 𝐴 ∈ ∪ ∪ 𝐶) | |
| 8 | 2, 6, 7 | sylancr 593 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → 𝐴 ∈ ∪ ∪ 𝐶) |
| 9 | 3 | prid2 4702 | . . 3 ⊢ 𝐵 ∈ {𝐴, 𝐵} |
| 10 | elunii 4850 | . . 3 ⊢ ((𝐵 ∈ {𝐴, 𝐵} ∧ {𝐴, 𝐵} ∈ ∪ 𝐶) → 𝐵 ∈ ∪ ∪ 𝐶) | |
| 11 | 9, 6, 10 | sylancr 593 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → 𝐵 ∈ ∪ ∪ 𝐶) |
| 12 | 8, 11 | jca 516 | 1 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → (𝐴 ∈ ∪ ∪ 𝐶 ∧ 𝐵 ∈ ∪ ∪ 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 ∈ wcel 2119 Vcvv 3432 {cpr 4564 〈cop 4568 ∪ cuni 4845 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 ax-sep 5225 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-v 3434 df-dif 3893 df-un 3895 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 |
| This theorem is referenced by: asymref 6073 asymref2 6074 wrdexb 14485 |
| Copyright terms: Public domain | W3C validator |