| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opi1 | Structured version Visualization version GIF version | ||
| Description: One of the two elements in an ordered pair. (Contributed by NM, 15-Jul-1993.) (Revised by Mario Carneiro, 26-Apr-2015.) (Avoid depending on this detail.) |
| Ref | Expression |
|---|---|
| opi1.1 | ⊢ 𝐴 ∈ V |
| opi1.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| opi1 | ⊢ {𝐴} ∈ 〈𝐴, 𝐵〉 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snex 5408 | . . 3 ⊢ {𝐴} ∈ V | |
| 2 | 1 | prid1 4726 | . 2 ⊢ {𝐴} ∈ {{𝐴}, {𝐴, 𝐵}} |
| 3 | opi1.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 4 | opi1.2 | . . 3 ⊢ 𝐵 ∈ V | |
| 5 | 3, 4 | dfop 4835 | . 2 ⊢ 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}} |
| 6 | 2, 5 | eleqtrri 2861 | 1 ⊢ {𝐴} ∈ 〈𝐴, 𝐵〉 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2145 Vcvv 3453 {csn 4587 {cpr 4589 〈cop 4593 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3455 df-dif 3905 df-un 3907 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 |
| This theorem is used by: opth1 5455 opth 5456 |
| Copyright terms: Public domain | W3C validator |