Theorem opelres 5976

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 5663	. . 3 ⊢ (𝑅 ↾ 𝐴) = (𝑅 ∩ (𝐴 × V))
2	1	elin2 4149	. 2 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝑅 ↾ 𝐴) ↔ (⟨𝐵, 𝐶⟩ ∈ 𝑅 ∧ ⟨𝐵, 𝐶⟩ ∈ (𝐴 × V)))
3		opelxp 5687	. . . 4 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝐴 × V) ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ V))
4		elex 3472	. . . . 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 2145  Vcvv 3451  ⟨cop 4590   × cxp 5649   ↾ cres 5653

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 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-opab 5168  df-xp 5657  df-res 5663

This theorem is used by:  brres  5977  opelresi  5978  opelidres  5982  h2hlm  31582  setsnidel  48458