Theorem brres2 39008

Description: Binary relation on a restriction. (Contributed by Peter Mazsa, 2-Jan-2019.) (Revised by Peter Mazsa, 16-Dec-2021.)

Assertion

Ref	Expression
brres2	⊢ (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ 𝐵(𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))𝐶)

Proof of Theorem brres2

Step	Hyp	Ref	Expression
1		brres 5983	. . 3 ⊢ (𝐶 ∈ ran (𝑅 ↾ 𝐴) → (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶)))
2	1	pm5.32i 585	. 2 ⊢ ((𝐶 ∈ ran (𝑅 ↾ 𝐴) ∧ 𝐵(𝑅 ↾ 𝐴)𝐶) ↔ (𝐶 ∈ ran (𝑅 ↾ 𝐴) ∧ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶)))
3		relres 6002	. . . 4 ⊢ Rel (𝑅 ↾ 𝐴)
4	3	relelrni 5937	. . 3 ⊢ (𝐵(𝑅 ↾ 𝐴)𝐶 → 𝐶 ∈ ran (𝑅 ↾ 𝐴))
5	4	pm4.71ri 570	. 2 ⊢ (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ (𝐶 ∈ ran (𝑅 ↾ 𝐴) ∧ 𝐵(𝑅 ↾ 𝐴)𝐶))
6		brinxp2 5737	. . 3 ⊢ (𝐵(𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))𝐶 ↔ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ ran (𝑅 ↾ 𝐴)) ∧ 𝐵𝑅𝐶))
7		df-3an 1105	. . 3 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ ran (𝑅 ↾ 𝐴) ∧ 𝐵𝑅𝐶) ↔ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ ran (𝑅 ↾ 𝐴)) ∧ 𝐵𝑅𝐶))
8		3anan12 1112	. . 3 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ ran (𝑅 ↾ 𝐴) ∧ 𝐵𝑅𝐶) ↔ (𝐶 ∈ ran (𝑅 ↾ 𝐴) ∧ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶)))
9	6, 7, 8	3bitr2i 302	. 2 ⊢ (𝐵(𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))𝐶 ↔ (𝐶 ∈ ran (𝑅 ↾ 𝐴) ∧ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶)))
10	2, 5, 9	3bitr4i 306	1 ⊢ (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ 𝐵(𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))𝐶)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2145   ∩ cin 3901   class class class wbr 5107   × cxp 5657  ran crn 5660   ↾ cres 5661

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-ext 2734  ax-sep 5255  ax-pr 5402

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 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-rel 5666  df-cnv 5667  df-dm 5669  df-rn 5670  df-res 5671

This theorem is used by:  brinxprnres  39032