Theorem brres2 39396

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 5987	. . 3 ⊢ (𝐶 ∈ ran (𝑅 ↾ 𝐴) → (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶)))
2	1	pm5.32i 585	. 2 ⊢ ((𝐶 ∈ ran (𝑅 ↾ 𝐴) ∧ 𝐵(𝑅 ↾ 𝐴)𝐶) ↔ (𝐶 ∈ ran (𝑅 ↾ 𝐴) ∧ (𝐵 ∈ 𝐴 ∧ 𝐵𝑅𝐶)))
3		relres 6006	. . . 4 ⊢ Rel (𝑅 ↾ 𝐴)
4	3	relelrni 5937	. . 3 ⊢ (𝐵(𝑅 ↾ 𝐴)𝐶 → 𝐶 ∈ ran (𝑅 ↾ 𝐴))
5	4	pm4.71ri 570	. 2 ⊢ (𝐵(𝑅 ↾ 𝐴)𝐶 ↔ (𝐶 ∈ ran (𝑅 ↾ 𝐴) ∧ 𝐵(𝑅 ↾ 𝐴)𝐶))
6		brinxp2 5734	. . 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 2147   ∩ cin 4092   class class class wbr 5106   × cxp 5653  ran crn 5656   ↾ cres 5657

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-xp 5661  df-rel 5662  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667

This theorem is used by:  brinxprnres  39420