Theorem opelres 5986

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.)

Assertion

Ref	Expression
opelres	⊢ (𝐶 ∈ 𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝑅 ↾ 𝐴) ↔ (𝐵 ∈ 𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))

Proof of Theorem opelres

Step	Hyp	Ref	Expression
1		df-res 5675	. . 3 ⊢ (𝑅 ↾ 𝐴) = (𝑅 ∩ (𝐴 × V))
2	1	elin2 4156	. 2 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝑅 ↾ 𝐴) ↔ (⟨𝐵, 𝐶⟩ ∈ 𝑅 ∧ ⟨𝐵, 𝐶⟩ ∈ (𝐴 × V)))
3		opelxp 5699	. . . 4 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝐴 × V) ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ V))
4		elex 3478	. . . . 5 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V)
5	4	biantrud 541	. . . 4 ⊢ (𝐶 ∈ 𝑉 → (𝐵 ∈ 𝐴 ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ V)))
6	3, 5	bitr4id 293	. . 3 ⊢ (𝐶 ∈ 𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝐴 × V) ↔ 𝐵 ∈ 𝐴))
7	6	anbi1cd 647	. 2 ⊢ (𝐶 ∈ 𝑉 → ((⟨𝐵, 𝐶⟩ ∈ 𝑅 ∧ ⟨𝐵, 𝐶⟩ ∈ (𝐴 × V)) ↔ (𝐵 ∈ 𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))
8	2, 7	bitrid 286	1 ⊢ (𝐶 ∈ 𝑉 → (⟨𝐵, 𝐶⟩ ∈ (𝑅 ↾ 𝐴) ↔ (𝐵 ∈ 𝐴 ∧ ⟨𝐵, 𝐶⟩ ∈ 𝑅)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2146  Vcvv 3457  ⟨cop 4597   × cxp 5661   ↾ cres 5665

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-opab 5176  df-xp 5669  df-res 5675

This theorem is used by:  brres  5987  opelresi  5988  opelidres  5992  h2hlm  31405  setsnidel  48186