Theorem eloprabg 7530

Description: The law of concretion for operation class abstraction. Compare elopab 5501. (Contributed by NM, 14-Sep-1999.) (Revised by David Abernethy, 19-Jun-2012.)

Hypotheses

Ref	Expression
eloprabg.1	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
eloprabg.2	⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
eloprabg.3	⊢ (𝑧 = 𝐶 → (𝜒 ↔ 𝜃))

Assertion

Ref	Expression
eloprabg	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜃))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝜃,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧)   𝜓(𝑥, 𝑦, 𝑧)   𝜒(𝑥, 𝑦, 𝑧)   𝑉(𝑥, 𝑦, 𝑧)   𝑊(𝑥, 𝑦, 𝑧)   𝑋(𝑥, 𝑦, 𝑧)

Proof of Theorem eloprabg

Step	Hyp	Ref	Expression
1		eloprabg.1	. . 3 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
2		eloprabg.2	. . 3 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒))
3		eloprabg.3	. . 3 ⊢ (𝑧 = 𝐶 → (𝜒 ↔ 𝜃))
4	1, 2, 3	syl3an9b 1462	. 2 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜃))
5	4	eloprabga 7529	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜃))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ⟨cop 4590  {coprab 7421

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-12 2213  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-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-oprab 7424

This theorem is used by:  ov  7564  ovg  7585  brbtwn  29477  isnvlem  31212  isphg  31419  fvtransport  36797  brcolinear2  36823  colineardim1  36826  fvray  36906  fvline  36909