| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opelres | Structured version Visualization version GIF version | ||
| Description: Ordered pair elementhood in a restriction. Exercise 13 of [TakeutiZaring] p. 25. (Contributed by NM, 13-Nov-1995.) (Revised by BJ, 18-Feb-2022.) Commute the consequent. (Revised by Peter Mazsa, 24-Sep-2022.) |
| Ref | Expression |
|---|---|
| opelres | ⊢ (𝐶 ∈ 𝑉 → (〈𝐵, 𝐶〉 ∈ (𝑅 ↾ 𝐴) ↔ (𝐵 ∈ 𝐴 ∧ 〈𝐵, 𝐶〉 ∈ 𝑅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-res 5660 | . . 3 ⊢ (𝑅 ↾ 𝐴) = (𝑅 ∩ (𝐴 × V)) | |
| 2 | 1 | elin2 4156 | . 2 ⊢ (〈𝐵, 𝐶〉 ∈ (𝑅 ↾ 𝐴) ↔ (〈𝐵, 𝐶〉 ∈ 𝑅 ∧ 〈𝐵, 𝐶〉 ∈ (𝐴 × V))) |
| 3 | opelxp 5684 | . . . 4 ⊢ (〈𝐵, 𝐶〉 ∈ (𝐴 × V) ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ V)) | |
| 4 | elex 3476 | . . . . 5 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V) | |
| 5 | 4 | biantrud 539 | . . . 4 ⊢ (𝐶 ∈ 𝑉 → (𝐵 ∈ 𝐴 ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ V))) |
| 6 | 3, 5 | bitr4id 292 | . . 3 ⊢ (𝐶 ∈ 𝑉 → (〈𝐵, 𝐶〉 ∈ (𝐴 × V) ↔ 𝐵 ∈ 𝐴)) |
| 7 | 6 | anbi1cd 644 | . 2 ⊢ (𝐶 ∈ 𝑉 → ((〈𝐵, 𝐶〉 ∈ 𝑅 ∧ 〈𝐵, 𝐶〉 ∈ (𝐴 × V)) ↔ (𝐵 ∈ 𝐴 ∧ 〈𝐵, 𝐶〉 ∈ 𝑅))) |
| 8 | 2, 7 | bitrid 285 | 1 ⊢ (𝐶 ∈ 𝑉 → (〈𝐵, 𝐶〉 ∈ (𝑅 ↾ 𝐴) ↔ (𝐵 ∈ 𝐴 ∧ 〈𝐵, 𝐶〉 ∈ 𝑅))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∈ wcel 2143 Vcvv 3455 〈cop 4589 × cxp 5646 ↾ cres 5650 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5247 ax-pr 5391 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3078 df-rex 3088 df-rab 3416 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-opab 5164 df-xp 5654 df-res 5660 |
| This theorem is referenced by: brres 5973 opelresi 5974 opelidres 5978 h2hlm 31184 setsnidel 47984 |
| Copyright terms: Public domain | W3C validator |