Theorem 2rbropap 5559

Description: Properties of a pair in a restricted binary relation 𝑀 expressed as an ordered-pair class abstraction: 𝑀 is the binary relation 𝑊 restricted by the conditions 𝜓 and 𝜏. (Contributed by AV, 31-Jan-2021.)

Hypotheses

Ref	Expression
2rbropap.1	⊢ (𝜑 → 𝑀 = {⟨𝑓, 𝑝⟩ ∣ (𝑓𝑊𝑝 ∧ 𝜓 ∧ 𝜏)})
2rbropap.2	⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (𝜓 ↔ 𝜒))
2rbropap.3	⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (𝜏 ↔ 𝜃))

Assertion

Ref	Expression
2rbropap	⊢ ((𝜑 ∧ 𝐹 ∈ 𝑋 ∧ 𝑃 ∈ 𝑌) → (𝐹𝑀𝑃 ↔ (𝐹𝑊𝑃 ∧ 𝜒 ∧ 𝜃)))

Distinct variable groups:   𝑓,𝐹,𝑝   𝑃,𝑓,𝑝   𝑓,𝑊,𝑝   𝜒,𝑓,𝑝   𝜃,𝑓,𝑝

Allowed substitution hints:   𝜑(𝑓,𝑝)   𝜓(𝑓,𝑝)   𝜏(𝑓,𝑝)   𝑀(𝑓,𝑝)   𝑋(𝑓,𝑝)   𝑌(𝑓,𝑝)

Proof of Theorem 2rbropap

Step	Hyp	Ref	Expression
1		2rbropap.1	. . . 4 ⊢ (𝜑 → 𝑀 = {⟨𝑓, 𝑝⟩ ∣ (𝑓𝑊𝑝 ∧ 𝜓 ∧ 𝜏)})
2		3anass 1092	. . . . 5 ⊢ ((𝑓𝑊𝑝 ∧ 𝜓 ∧ 𝜏) ↔ (𝑓𝑊𝑝 ∧ (𝜓 ∧ 𝜏)))
3	2	opabbii 5208	. . . 4 ⊢ {⟨𝑓, 𝑝⟩ ∣ (𝑓𝑊𝑝 ∧ 𝜓 ∧ 𝜏)} = {⟨𝑓, 𝑝⟩ ∣ (𝑓𝑊𝑝 ∧ (𝜓 ∧ 𝜏))}
4	1, 3	eqtrdi 2782	. . 3 ⊢ (𝜑 → 𝑀 = {⟨𝑓, 𝑝⟩ ∣ (𝑓𝑊𝑝 ∧ (𝜓 ∧ 𝜏))})
5		2rbropap.2	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (𝜓 ↔ 𝜒))
6		2rbropap.3	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (𝜏 ↔ 𝜃))
7	5, 6	anbi12d 630	. . 3 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → ((𝜓 ∧ 𝜏) ↔ (𝜒 ∧ 𝜃)))
8	4, 7	rbropap 5558	. 2 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝑋 ∧ 𝑃 ∈ 𝑌) → (𝐹𝑀𝑃 ↔ (𝐹𝑊𝑃 ∧ (𝜒 ∧ 𝜃))))
9		3anass 1092	. 2 ⊢ ((𝐹𝑊𝑃 ∧ 𝜒 ∧ 𝜃) ↔ (𝐹𝑊𝑃 ∧ (𝜒 ∧ 𝜃)))
10	8, 9	bitr4di 289	1 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝑋 ∧ 𝑃 ∈ 𝑌) → (𝐹𝑀𝑃 ↔ (𝐹𝑊𝑃 ∧ 𝜒 ∧ 𝜃)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098   class class class wbr 5141  {copab 5203

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-br 5142  df-opab 5204

This theorem is referenced by:  iswlkon  29423