| 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 4727 | . . 3 ⊢ 𝐴 ∈ {𝐴, 𝐵} |
| 3 | opeluu.2 | . . . . 5 ⊢ 𝐵 ∈ V | |
| 4 | 1, 3 | opi2 5450 | . . . 4 ⊢ {𝐴, 𝐵} ∈ 〈𝐴, 𝐵〉 |
| 5 | elunii 4876 | . . . 4 ⊢ (({𝐴, 𝐵} ∈ 〈𝐴, 𝐵〉 ∧ 〈𝐴, 𝐵〉 ∈ 𝐶) → {𝐴, 𝐵} ∈ ∪ 𝐶) | |
| 6 | 4, 5 | mpan 702 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → {𝐴, 𝐵} ∈ ∪ 𝐶) |
| 7 | elunii 4876 | . . 3 ⊢ ((𝐴 ∈ {𝐴, 𝐵} ∧ {𝐴, 𝐵} ∈ ∪ 𝐶) → 𝐴 ∈ ∪ ∪ 𝐶) | |
| 8 | 2, 6, 7 | sylancr 598 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → 𝐴 ∈ ∪ ∪ 𝐶) |
| 9 | 3 | prid2 4728 | . . 3 ⊢ 𝐵 ∈ {𝐴, 𝐵} |
| 10 | elunii 4876 | . . 3 ⊢ ((𝐵 ∈ {𝐴, 𝐵} ∧ {𝐴, 𝐵} ∈ ∪ 𝐶) → 𝐵 ∈ ∪ ∪ 𝐶) | |
| 11 | 9, 6, 10 | sylancr 598 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → 𝐵 ∈ ∪ ∪ 𝐶) |
| 12 | 8, 11 | jca 520 | 1 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐶 → (𝐴 ∈ ∪ ∪ 𝐶 ∧ 𝐵 ∈ ∪ ∪ 𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 ∈ wcel 2142 Vcvv 3454 {cpr 4590 〈cop 4594 ∪ cuni 4871 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5256 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3456 df-dif 3907 df-un 3909 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 |
| This theorem is used by: asymref 6115 asymref2 6116 wrdexb 14569 |
| Copyright terms: Public domain | W3C validator |