Theorem 2rbropap 5551

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 1111	. . . . 5 ⊢ ((𝑓𝑊𝑝 ∧ 𝜓 ∧ 𝜏) ↔ (𝑓𝑊𝑝 ∧ (𝜓 ∧ 𝜏)))
3	2	opabbii 5180	. . . 4 ⊢ {⟨𝑓, 𝑝⟩ ∣ (𝑓𝑊𝑝 ∧ 𝜓 ∧ 𝜏)} = {⟨𝑓, 𝑝⟩ ∣ (𝑓𝑊𝑝 ∧ (𝜓 ∧ 𝜏))}
4	1, 3	eqtrdi 2816	. . 3 ⊢ (𝜑 → 𝑀 = {⟨𝑓, 𝑝⟩ ∣ (𝑓𝑊𝑝 ∧ (𝜓 ∧ 𝜏))})
5		2rbropap.2	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (𝜓 ↔ 𝜒))
6		2rbropap.3	. . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → (𝜏 ↔ 𝜃))
7	5, 6	anbi12d 644	. . 3 ⊢ ((𝑓 = 𝐹 ∧ 𝑝 = 𝑃) → ((𝜓 ∧ 𝜏) ↔ (𝜒 ∧ 𝜃)))
8	4, 7	rbropap 5550	. 2 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝑋 ∧ 𝑃 ∈ 𝑌) → (𝐹𝑀𝑃 ↔ (𝐹𝑊𝑃 ∧ (𝜒 ∧ 𝜃))))
9		3anass 1111	. 2 ⊢ ((𝐹𝑊𝑃 ∧ 𝜒 ∧ 𝜃) ↔ (𝐹𝑊𝑃 ∧ (𝜒 ∧ 𝜃)))
10	8, 9	bitr4di 292	1 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝑋 ∧ 𝑃 ∈ 𝑌) → (𝐹𝑀𝑃 ↔ (𝐹𝑊𝑃 ∧ 𝜒 ∧ 𝜃)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   class class class wbr 5111  {copab 5175

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  ax-sep 5259  ax-pr 5406

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-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176

This theorem is used by:  iswlkon  30039