| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > opeq2 | GIF version | ||
| Description: Equality theorem for ordered pairs. (Contributed by NM, 25-Jun-1998.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| opeq2 | ⊢ (𝐴 = 𝐵 → 〈𝐶, 𝐴〉 = 〈𝐶, 𝐵〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 2301 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ V ↔ 𝐵 ∈ V)) | |
| 2 | 1 | anbi2d 468 | . . . . 5 ⊢ (𝐴 = 𝐵 → ((𝐶 ∈ V ∧ 𝐴 ∈ V) ↔ (𝐶 ∈ V ∧ 𝐵 ∈ V))) |
| 3 | eqidd 2239 | . . . . . . 7 ⊢ (𝐴 = 𝐵 → {𝐶} = {𝐶}) | |
| 4 | preq2 3789 | . . . . . . 7 ⊢ (𝐴 = 𝐵 → {𝐶, 𝐴} = {𝐶, 𝐵}) | |
| 5 | 3, 4 | preq12d 3796 | . . . . . 6 ⊢ (𝐴 = 𝐵 → {{𝐶}, {𝐶, 𝐴}} = {{𝐶}, {𝐶, 𝐵}}) |
| 6 | 5 | eleq2d 2308 | . . . . 5 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ {{𝐶}, {𝐶, 𝐴}} ↔ 𝑥 ∈ {{𝐶}, {𝐶, 𝐵}})) |
| 7 | 2, 6 | anbi12d 477 | . . . 4 ⊢ (𝐴 = 𝐵 → (((𝐶 ∈ V ∧ 𝐴 ∈ V) ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐴}}) ↔ ((𝐶 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐵}}))) |
| 8 | df-3an 1011 | . . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐴 ∈ V ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐴}}) ↔ ((𝐶 ∈ V ∧ 𝐴 ∈ V) ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐴}})) | |
| 9 | df-3an 1011 | . . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐵}}) ↔ ((𝐶 ∈ V ∧ 𝐵 ∈ V) ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐵}})) | |
| 10 | 7, 8, 9 | 3bitr4g 223 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝐶 ∈ V ∧ 𝐴 ∈ V ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐴}}) ↔ (𝐶 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐵}}))) |
| 11 | 10 | abbidv 2358 | . 2 ⊢ (𝐴 = 𝐵 → {𝑥 ∣ (𝐶 ∈ V ∧ 𝐴 ∈ V ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐴}})} = {𝑥 ∣ (𝐶 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐵}})}) |
| 12 | df-op 3718 | . 2 ⊢ 〈𝐶, 𝐴〉 = {𝑥 ∣ (𝐶 ∈ V ∧ 𝐴 ∈ V ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐴}})} | |
| 13 | df-op 3718 | . 2 ⊢ 〈𝐶, 𝐵〉 = {𝑥 ∣ (𝐶 ∈ V ∧ 𝐵 ∈ V ∧ 𝑥 ∈ {{𝐶}, {𝐶, 𝐵}})} | |
| 14 | 11, 12, 13 | 3eqtr4g 2296 | 1 ⊢ (𝐴 = 𝐵 → 〈𝐶, 𝐴〉 = 〈𝐶, 𝐵〉) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 {cab 2224 Vcvv 2821 {csn 3709 {cpr 3710 〈cop 3712 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-v 2823 df-un 3224 df-sn 3715 df-pr 3716 df-op 3718 |
| This theorem is used by: opeq12 3906 opeq2i 3908 opeq2d 3911 oteq2 3914 oteq3 3915 breq2 4134 cbvopab2 4205 cbvopab2v 4208 opthg 4378 eqvinop 4383 opelopabsb 4402 opelxp 4804 opabid2 4911 elrn2g 4970 opeldm 4984 opeldmg 4986 elrn2 5024 opelresg 5070 iss 5109 elimasng 5155 issref 5170 dmsnopg 5259 cnvsng 5273 elxp4 5275 elxp5 5276 dffun5r 5389 funopg 5411 f1osng 5682 tz6.12f 5724 fsn 5880 fsng 5881 fvsng 5911 oveq2 6093 cbvoprab2 6161 ovg 6228 opabex3d 6350 opabex3 6351 op1stg 6384 op2ndg 6385 oprssdmm 6405 op1steq 6413 dfoprab4f 6427 elmpom 6474 tfrlemibxssdm 6598 tfr1onlembxssdm 6614 tfrcllembxssdm 6627 elixpsn 7017 ixpsnf1o 7018 mapsnend 7099 mapsnen 7100 xpsnen 7119 xpassen 7128 xpf1o 7144 djulclr 7389 djurclr 7390 djulcl 7391 djurcl 7392 djulclb 7395 inl11 7405 djuss 7410 1stinl 7414 2ndinl 7415 1stinr 7416 2ndinr 7417 elreal 8195 ax1rid 8244 fseq1p1m1 10501 pfxval 11446 swrdccatin1 11497 swrdccat3blem 11511 imasaddfnlemg 13635 cnmpt21 15392 djucllem 16828 |
| Copyright terms: Public domain | W3C validator |