Theorem opeldmd 5898

Description: Membership of first of an ordered pair in a domain. Deduction version of opeldm 5899. (Contributed by AV, 11-Mar-2021.)

Hypotheses

Ref	Expression
opeldmd.1	⊢ (𝜑 → 𝐴 ∈ 𝑉)
opeldmd.2	⊢ (𝜑 → 𝐵 ∈ 𝑊)

Assertion

Ref	Expression
opeldmd	⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ 𝐶 → 𝐴 ∈ dom 𝐶))

Proof of Theorem opeldmd

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		opeldmd.2	. . 3 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
2		opeq2 4841	. . . . 5 ⊢ (𝑦 = 𝐵 → ⟨𝐴, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
3	2	eleq1d 2850	. . . 4 ⊢ (𝑦 = 𝐵 → (⟨𝐴, 𝑦⟩ ∈ 𝐶 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐶))
4	3	spcegv 3558	. . 3 ⊢ (𝐵 ∈ 𝑊 → (⟨𝐴, 𝐵⟩ ∈ 𝐶 → ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶))
5	1, 4	syl 18	. 2 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ 𝐶 → ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶))
6		opeldmd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
7		eldm2g 5891	. . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ dom 𝐶 ↔ ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶))
8	6, 7	syl 18	. 2 ⊢ (𝜑 → (𝐴 ∈ dom 𝐶 ↔ ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶))
9	5, 8	sylibrd 262	1 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ 𝐶 → 𝐴 ∈ dom 𝐶))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570  ∃wex 1812   ∈ wcel 2146  ⟨cop 4597  dom cdm 5663

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

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-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-dm 5673

This theorem is used by:  eupth2eucrct  30639  tfsconcatb0  44129