| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Ordered pair membership in a restriction. Exercise 13 of [TakeutiZaring] p. 25. |
| Ref | Expression |
|---|---|
| opelres.1 | ⊢ B ∈ V |
| Ref | Expression |
|---|---|
| opelres | ⊢ (〈A, B〉 ∈ (C ↾ D) ↔ (〈A, B〉 ∈ C ∧ A ∈ D)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-res 2430 | . . 3 ⊢ (C ↾ D) = (C ∩ (D × V)) | |
| 2 | 1 | eleq2i 1153 | . 2 ⊢ (〈A, B〉 ∈ (C ↾ D) ↔ 〈A, B〉 ∈ (C ∩ (D × V))) |
| 3 | elin 1635 | . 2 ⊢ (〈A, B〉 ∈ (C ∩ (D × V)) ↔ (〈A, B〉 ∈ C ∧ 〈A, B〉 ∈ (D × V))) | |
| 4 | opelres.1 | . . . . 5 ⊢ B ∈ V | |
| 5 | 4 | opelxp 2452 | . . . 4 ⊢ (〈A, B〉 ∈ (D × V) ↔ (A ∈ D ∧ B ∈ V)) |
| 6 | 5, 4 | mpbiranr 548 | . . 3 ⊢ (〈A, B〉 ∈ (D × V) ↔ A ∈ D) |
| 7 | 6 | anbi2i 367 | . 2 ⊢ ((〈A, B〉 ∈ C ∧ 〈A, B〉 ∈ (D × V)) ↔ (〈A, B〉 ∈ C ∧ A ∈ D)) |
| 8 | 2, 3, 7 | 3bitr 155 | 1 ⊢ (〈A, B〉 ∈ (C ↾ D) ↔ (〈A, B〉 ∈ C ∧ A ∈ D)) |
| Colors of variables: wff set class |
| Syntax hints: ↔ wb 127 ∧ wa 196 ∈ wcel 1092 Vcvv 1348 ∩ cin 1486 〈cop 1810 × cxp 2408 ↾ cres 2412 |
| This theorem is referenced by: opres 2580 dmres 2584 relssres 2596 iss 2599 cores 2659 funssres 2698 fcoi1 2765 fcoi2 2766 fcnvres 2768 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-pow 1077 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-ex 679 df-sb 853 df-clab 1093 df-cleq 1097 df-clel 1099 df-v 1349 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-nul 1708 df-pw 1799 df-sn 1811 df-pr 1812 df-op 1815 df-opab 2098 df-xp 2424 df-res 2430 |