Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elop | Structured version Visualization version GIF version |
Description: Characterization of the elements of an ordered pair. Exercise 3 of [TakeutiZaring] p. 15. (Contributed by NM, 15-Jul-1993.) (Revised by Mario Carneiro, 26-Apr-2015.) Remove an extraneous hypothesis. (Revised by BJ, 25-Dec-2020.) (Avoid depending on this detail.) |
Ref | Expression |
---|---|
elop.1 | ⊢ 𝐵 ∈ V |
elop.2 | ⊢ 𝐶 ∈ V |
Ref | Expression |
---|---|
elop | ⊢ (𝐴 ∈ 〈𝐵, 𝐶〉 ↔ (𝐴 = {𝐵} ∨ 𝐴 = {𝐵, 𝐶})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elop.1 | . 2 ⊢ 𝐵 ∈ V | |
2 | elop.2 | . 2 ⊢ 𝐶 ∈ V | |
3 | elopg 4934 | . 2 ⊢ ((𝐵 ∈ V ∧ 𝐶 ∈ V) → (𝐴 ∈ 〈𝐵, 𝐶〉 ↔ (𝐴 = {𝐵} ∨ 𝐴 = {𝐵, 𝐶}))) | |
4 | 1, 2, 3 | mp2an 708 | 1 ⊢ (𝐴 ∈ 〈𝐵, 𝐶〉 ↔ (𝐴 = {𝐵} ∨ 𝐴 = {𝐵, 𝐶})) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∨ wo 383 = wceq 1483 ∈ wcel 1990 Vcvv 3200 {csn 4177 {cpr 4179 〈cop 4183 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 |
This theorem is referenced by: relop 5272 |
Copyright terms: Public domain | W3C validator |