Theorem opeldmd 5900

Description: Membership of first of an ordered pair in a domain. Deduction version of opeldm 5901. (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 4846	. . . . 5 ⊢ (𝑦 = 𝐵 → ⟨𝐴, 𝑦⟩ = ⟨𝐴, 𝐵⟩)
3	2	eleq1d 2849	. . . 4 ⊢ (𝑦 = 𝐵 → (⟨𝐴, 𝑦⟩ ∈ 𝐶 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐶))
4	3	spcegv 3555	. . 3 ⊢ (𝐵 ∈ 𝑊 → (⟨𝐴, 𝐵⟩ ∈ 𝐶 → ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶))
5	1, 4	syl 18	. 2 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩ ∈ 𝐶 → ∃𝑦⟨𝐴, 𝑦⟩ ∈ 𝐶))
6		opeldmd.1	. . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
7		eldm2g 5893	. . 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 2147  ⟨cop 4840  dom cdm 5658

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-dm 5668

This theorem is used by:  eupth2eucrct  30875  tfsconcatb0  44607