Theorem eloprabg 6176

Description: The law of concretion for operation class abstraction. Compare elopab 4400. (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 1351	. 2 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜃))
5	4	eloprabga 6175	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (⟨⟨𝐴, 𝐵⟩, 𝐶⟩ ∈ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ 𝜃))

This proof depends on syntax axioms:   → wi 4   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ⟨cop 3712  {coprab 6086

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-oprab 6089

This theorem is used by:  ov  6208  ovg  6228