| 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 4135 cbvopab2 4206 cbvopab2v 4209 opthg 4380 eqvinop 4385 opelopabsb 4404 opelxp 4806 opabid2 4913 elrn2g 4972 opeldm 4986 opeldmg 4988 elrn2 5026 opelresg 5072 iss 5112 elimasng 5158 issref 5173 dmsnopg 5262 cnvsng 5276 elxp4 5278 elxp5 5279 dffun5r 5392 funopg 5414 f1osng 5685 tz6.12f 5727 fsn 5883 fsng 5884 fvsng 5914 oveq2 6096 cbvoprab2 6164 ovg 6231 opabex3d 6354 opabex3 6355 op1stg 6388 op2ndg 6389 oprssdmm 6409 op1steq 6417 dfoprab4f 6431 elmpom 6478 tfrlemibxssdm 6602 tfr1onlembxssdm 6618 tfrcllembxssdm 6631 elixpsn 7021 ixpsnf1o 7022 mapsnend 7103 mapsnen 7104 xpsnen 7123 xpassen 7132 xpf1o 7148 djulclr 7395 djurclr 7396 djulcl 7397 djurcl 7398 djulclb 7401 inl11 7411 djuss 7416 1stinl 7420 2ndinl 7421 1stinr 7422 2ndinr 7423 elreal 8201 ax1rid 8250 fseq1p1m1 10518 pfxval 11468 swrdccatin1 11519 swrdccat3blem 11533 imasaddfnlemg 13694 gsumcom2fi 14275 cnmpt21 15517 djucllem 17033 |
| Copyright terms: Public domain | W3C validator |