![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > elopg | Structured version Visualization version GIF version |
Description: Characterization of the elements of an ordered pair. Closed form of elop 5469. (Contributed by BJ, 22-Jun-2019.) (Avoid depending on this detail.) |
Ref | Expression |
---|---|
elopg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ ⟨𝐴, 𝐵⟩ ↔ (𝐶 = {𝐴} ∨ 𝐶 = {𝐴, 𝐵}))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfopg 4872 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}}) | |
2 | eleq2 2818 | . . 3 ⊢ (⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}} → (𝐶 ∈ ⟨𝐴, 𝐵⟩ ↔ 𝐶 ∈ {{𝐴}, {𝐴, 𝐵}})) | |
3 | snex 5433 | . . . 4 ⊢ {𝐴} ∈ V | |
4 | prex 5434 | . . . 4 ⊢ {𝐴, 𝐵} ∈ V | |
5 | 3, 4 | elpr2 4654 | . . 3 ⊢ (𝐶 ∈ {{𝐴}, {𝐴, 𝐵}} ↔ (𝐶 = {𝐴} ∨ 𝐶 = {𝐴, 𝐵})) |
6 | 2, 5 | bitrdi 287 | . 2 ⊢ (⟨𝐴, 𝐵⟩ = {{𝐴}, {𝐴, 𝐵}} → (𝐶 ∈ ⟨𝐴, 𝐵⟩ ↔ (𝐶 = {𝐴} ∨ 𝐶 = {𝐴, 𝐵}))) |
7 | 1, 6 | syl 17 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ ⟨𝐴, 𝐵⟩ ↔ (𝐶 = {𝐴} ∨ 𝐶 = {𝐴, 𝐵}))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∨ wo 846 = wceq 1534 ∈ wcel 2099 {csn 4629 {cpr 4631 ⟨cop 4635 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pr 5429 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-sb 2061 df-clab 2706 df-cleq 2720 df-clel 2806 df-v 3473 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 |
This theorem is referenced by: elop 5469 bj-inftyexpidisj 36689 |
Copyright terms: Public domain | W3C validator |