| 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 5416 | . . 3 ⊢ {𝐴} ∈ 〈𝐴, 𝐵〉 |
| 4 | id 22 | . . 3 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 → 〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉) | |
| 5 | 3, 4 | eleqtrid 2842 | . 2 ⊢ (〈𝐴, 𝐵〉 = 〈𝐶, 𝐷〉 → {𝐴} ∈ 〈𝐶, 𝐷〉) |
| 6 | 1 | sneqr 4796 | . . . 4 ⊢ ({𝐴} = {𝐶} → 𝐴 = 𝐶) |
| 7 | 6 | a1i 11 | . . 3 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → ({𝐴} = {𝐶} → 𝐴 = 𝐶)) |
| 8 | oprcl 4855 | . . . . . . 7 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → (𝐶 ∈ V ∧ 𝐷 ∈ V)) | |
| 9 | 8 | simpld 494 | . . . . . 6 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → 𝐶 ∈ V) |
| 10 | prid1g 4717 | . . . . . 6 ⊢ (𝐶 ∈ V → 𝐶 ∈ {𝐶, 𝐷}) | |
| 11 | 9, 10 | syl 17 | . . . . 5 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → 𝐶 ∈ {𝐶, 𝐷}) |
| 12 | eleq2 2825 | . . . . 5 ⊢ ({𝐴} = {𝐶, 𝐷} → (𝐶 ∈ {𝐴} ↔ 𝐶 ∈ {𝐶, 𝐷})) | |
| 13 | 11, 12 | syl5ibrcom 247 | . . . 4 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → ({𝐴} = {𝐶, 𝐷} → 𝐶 ∈ {𝐴})) |
| 14 | elsni 4597 | . . . . 5 ⊢ (𝐶 ∈ {𝐴} → 𝐶 = 𝐴) | |
| 15 | 14 | eqcomd 2742 | . . . 4 ⊢ (𝐶 ∈ {𝐴} → 𝐴 = 𝐶) |
| 16 | 13, 15 | syl6 35 | . . 3 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → ({𝐴} = {𝐶, 𝐷} → 𝐴 = 𝐶)) |
| 17 | id 22 | . . . . 5 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → {𝐴} ∈ 〈𝐶, 𝐷〉) | |
| 18 | dfopg 4827 | . . . . . 6 ⊢ ((𝐶 ∈ V ∧ 𝐷 ∈ V) → 〈𝐶, 𝐷〉 = {{𝐶}, {𝐶, 𝐷}}) | |
| 19 | 8, 18 | syl 17 | . . . . 5 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → 〈𝐶, 𝐷〉 = {{𝐶}, {𝐶, 𝐷}}) |
| 20 | 17, 19 | eleqtrd 2838 | . . . 4 ⊢ ({𝐴} ∈ 〈𝐶, 𝐷〉 → {𝐴} ∈ {{𝐶}, {𝐶, 𝐷}}) |
| 21 | elpri 4604 | . . . 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 1541 ∈ wcel 2113 Vcvv 3440 {csn 4580 {cpr 4582 〈cop 4586 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2715 df-cleq 2728 df-clel 2811 df-v 3442 df-dif 3904 df-un 3906 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 |
| This theorem is referenced by: opth 5424 dmsnopg 6171 funcnvsn 6542 oprabidw 7389 oprabid 7390 seqomlem2 8382 unxpdomlem3 9158 dfac5lem4 10036 dfac5lem4OLD 10038 dcomex 10357 canthwelem 10561 uzrdgfni 13881 fnpr2ob 17479 gsum2d2 19903 noseqrdgfn 28302 poimirlem9 37830 ichnreuop 47718 ichreuopeq 47719 diag1f1lem 49551 idfudiag1bas 49769 |
| Copyright terms: Public domain | W3C validator |