![]() |
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 5712 | . . 3 ⊢ (𝑅 ↾ 𝐴) = (𝑅 ∩ (𝐴 × V)) | |
2 | 1 | elin2 4226 | . 2 ⊢ (〈𝐵, 𝐶〉 ∈ (𝑅 ↾ 𝐴) ↔ (〈𝐵, 𝐶〉 ∈ 𝑅 ∧ 〈𝐵, 𝐶〉 ∈ (𝐴 × V))) |
3 | opelxp 5736 | . . . 4 ⊢ (〈𝐵, 𝐶〉 ∈ (𝐴 × V) ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ V)) | |
4 | elex 3509 | . . . . 5 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V) | |
5 | 4 | biantrud 531 | . . . 4 ⊢ (𝐶 ∈ 𝑉 → (𝐵 ∈ 𝐴 ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ V))) |
6 | 3, 5 | bitr4id 290 | . . 3 ⊢ (𝐶 ∈ 𝑉 → (〈𝐵, 𝐶〉 ∈ (𝐴 × V) ↔ 𝐵 ∈ 𝐴)) |
7 | 6 | anbi1cd 634 | . 2 ⊢ (𝐶 ∈ 𝑉 → ((〈𝐵, 𝐶〉 ∈ 𝑅 ∧ 〈𝐵, 𝐶〉 ∈ (𝐴 × V)) ↔ (𝐵 ∈ 𝐴 ∧ 〈𝐵, 𝐶〉 ∈ 𝑅))) |
8 | 2, 7 | bitrid 283 | 1 ⊢ (𝐶 ∈ 𝑉 → (〈𝐵, 𝐶〉 ∈ (𝑅 ↾ 𝐴) ↔ (𝐵 ∈ 𝐴 ∧ 〈𝐵, 𝐶〉 ∈ 𝑅))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2108 Vcvv 3488 〈cop 4654 × cxp 5698 ↾ cres 5702 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-opab 5229 df-xp 5706 df-res 5712 |
This theorem is referenced by: brres 6016 opelresi 6017 opelidres 6021 h2hlm 31012 setsnidel 47251 |
Copyright terms: Public domain | W3C validator |