![]() |
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 5323 | . 2 ⊢ ((𝐵 ∈ V ∧ 𝐶 ∈ V) → (𝐴 ∈ 〈𝐵, 𝐶〉 ↔ (𝐴 = {𝐵} ∨ 𝐴 = {𝐵, 𝐶}))) | |
4 | 1, 2, 3 | mp2an 691 | 1 ⊢ (𝐴 ∈ 〈𝐵, 𝐶〉 ↔ (𝐴 = {𝐵} ∨ 𝐴 = {𝐵, 𝐶})) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∨ wo 844 = wceq 1538 ∈ wcel 2111 Vcvv 3441 {csn 4525 {cpr 4527 〈cop 4531 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 |
This theorem is referenced by: relop 5685 |
Copyright terms: Public domain | W3C validator |