Theorem opelresg 4821

Description: Ordered pair membership in a restriction. Exercise 13 of [TakeutiZaring] p. 25. (Contributed by NM, 14-Oct-2005.)

Assertion

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

Proof of Theorem opelresg

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		opeq2 3701	. . 3 ⊢ (𝑦 = 𝐵 → ⟨𝐴, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
2	1	eleq1d 2206	. 2 ⊢ (𝑦 = 𝐵 → (⟨𝐴, 𝑦⟩ ∈ (𝐶 ↾ 𝐷) ↔ ⟨𝐴, 𝐵⟩ ∈ (𝐶 ↾ 𝐷)))
3	1	eleq1d 2206	. . 3 ⊢ (𝑦 = 𝐵 → (⟨𝐴, 𝑦⟩ ∈ 𝐶 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐶))
4	3	anbi1d 460	. 2 ⊢ (𝑦 = 𝐵 → ((⟨𝐴, 𝑦⟩ ∈ 𝐶 ∧ 𝐴 ∈ 𝐷) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝐶 ∧ 𝐴 ∈ 𝐷)))
5		vex 2684	. . 3 ⊢ 𝑦 ∈ V
6	5	opelres 4819	. 2 ⊢ (⟨𝐴, 𝑦⟩ ∈ (𝐶 ↾ 𝐷) ↔ (⟨𝐴, 𝑦⟩ ∈ 𝐶 ∧ 𝐴 ∈ 𝐷))
7	2, 4, 6	vtoclbg 2742	1 ⊢ (𝐵 ∈ 𝑉 → (⟨𝐴, 𝐵⟩ ∈ (𝐶 ↾ 𝐷) ↔ (⟨𝐴, 𝐵⟩ ∈ 𝐶 ∧ 𝐴 ∈ 𝐷)))

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   = wceq 1331   ∈ wcel 1480  ⟨cop 3525   ↾ cres 4536

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-sep 4041  ax-pow 4093  ax-pr 4126

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-opab 3985  df-xp 4540  df-res 4546

This theorem is referenced by:  brresg  4822  opelresi  4825  issref  4916