Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > opres | Structured version Visualization version GIF version |
Description: Ordered pair membership in a restriction when the first member belongs to the restricting class. (Contributed by NM, 30-Apr-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
Ref | Expression |
---|---|
opres.1 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
opres | ⊢ (𝐴 ∈ 𝐷 → (〈𝐴, 𝐵〉 ∈ (𝐶 ↾ 𝐷) ↔ 〈𝐴, 𝐵〉 ∈ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opres.1 | . . 3 ⊢ 𝐵 ∈ V | |
2 | 1 | opelres 5322 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (𝐶 ↾ 𝐷) ↔ (〈𝐴, 𝐵〉 ∈ 𝐶 ∧ 𝐴 ∈ 𝐷)) |
3 | 2 | rbaib 945 | 1 ⊢ (𝐴 ∈ 𝐷 → (〈𝐴, 𝐵〉 ∈ (𝐶 ↾ 𝐷) ↔ 〈𝐴, 𝐵〉 ∈ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∈ wcel 1977 Vcvv 3173 〈cop 4131 ↾ cres 5040 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-opab 4644 df-xp 5044 df-res 5050 |
This theorem is referenced by: resieq 5327 2elresin 5916 mdetunilem9 20245 |
Copyright terms: Public domain | W3C validator |