| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opth1 | Structured version Visualization version GIF version | ||
| Description: Equality of the first members of equal ordered pairs. (Contributed by NM, 28-May-2008.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| opth1.1 | ⊢ 𝐴 ∈ V |
| opth1.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| opth1 | ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 → 𝐴 = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opth1.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 2 | opth1.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 3 | 1, 2 | opi1 5431 | . . 3 ⊢ {𝐴} ∈ 〈𝐴, 𝐵〉 |
| 4 | id 22 | . . 3 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉) | |
| 5 | 3, 4 | eleqtrid 2835 | . 2 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 → {𝐴} ∈ 〈𝐶, 𝐷〉) |
| 6 | 1 | sneqr 4807 | . . . 4 ⊢ ({𝐴} = {𝐶} → 𝐴 = 𝐶) |
| 7 | 6 | a1i 11 | . . 3 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → ({𝐴} = {𝐶} → 𝐴 = 𝐶)) |
| 8 | oprcl 4866 | . . . . . . 7 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → (𝐶 ∈ V ∧ 𝐷 ∈ V)) | |
| 9 | 8 | simpld 494 | . . . . . 6 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → 𝐶 ∈ V) |
| 10 | prid1g 4727 | . . . . . 6 ⊢ (𝐶 ∈ V → 𝐶 ∈ {𝐶, 𝐷}) | |
| 11 | 9, 10 | syl 17 | . . . . 5 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → 𝐶 ∈ {𝐶, 𝐷}) |
| 12 | eleq2 2818 | . . . . 5 ⊢ ({𝐴} = {𝐶, 𝐷} → (𝐶 ∈ {𝐴} ↔ 𝐶 ∈ {𝐶, 𝐷})) | |
| 13 | 11, 12 | syl5ibrcom 247 | . . . 4 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → ({𝐴} = {𝐶, 𝐷} → 𝐶 ∈ {𝐴})) |
| 14 | elsni 4609 | . . . . 5 ⊢ (𝐶 ∈ {𝐴} → 𝐶 = 𝐴) | |
| 15 | 14 | eqcomd 2736 | . . . 4 ⊢ (𝐶 ∈ {𝐴} → 𝐴 = 𝐶) |
| 16 | 13, 15 | syl6 35 | . . 3 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → ({𝐴} = {𝐶, 𝐷} → 𝐴 = 𝐶)) |
| 17 | id 22 | . . . . 5 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → {𝐴} ∈ 〈𝐶, 𝐷〉) | |
| 18 | dfopg 4838 | . . . . . 6 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 〈𝐶, 𝐷〉 = {{𝐶}, {𝐶, 𝐷}}) | |
| 19 | 8, 18 | syl 17 | . . . . 5 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → 〈𝐶, 𝐷〉 = {{𝐶}, {𝐶, 𝐷}}) |
| 20 | 17, 19 | eleqtrd 2831 | . . . 4 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → {𝐴} ∈ {{𝐶}, {𝐶, 𝐷}}) |
| 21 | elpri 4616 | . . . 4 ⊢ ({𝐴} ∈ {{𝐶}, {𝐶, 𝐷}} → ({𝐴} = {𝐶} ∨ {𝐴} = {𝐶, 𝐷})) | |
| 22 | 20, 21 | syl 17 | . . 3 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → ({𝐴} = {𝐶} ∨ {𝐴} = {𝐶, 𝐷})) |
| 23 | 7, 16, 22 | mpjaod 860 | . 2 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → 𝐴 = 𝐶) |
| 24 | 5, 23 | syl 17 | 1 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 → 𝐴 = 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 Vcvv 3450 {csn 4592 {cpr 4594 〈cop 4598 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2709 df-cleq 2722 df-clel 2804 df-v 3452 df-dif 3920 df-un 3922 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 |
| This theorem is referenced by: opth 5439 dmsnopg 6189 funcnvsn 6569 oprabidw 7421 oprabid 7422 seqomlem2 8422 unxpdomlem3 9206 dfac5lem4 10086 dfac5lem4OLD 10088 dcomex 10407 canthwelem 10610 uzrdgfni 13930 fnpr2ob 17528 gsum2d2 19911 noseqrdgfn 28207 poimirlem9 37630 ichnreuop 47477 ichreuopeq 47478 diag1f1lem 49299 idfudiag1bas 49517 |
| Copyright terms: Public domain | W3C validator |