Theorem dfres3 5944

Description: Alternate definition of restriction. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.)

Assertion

Ref	Expression
dfres3	⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × ran 𝐴))

Proof of Theorem dfres3

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-res 5643	. 2 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × V))
2		eleq1 2816	. . . . . . . . . 10 ⊢ (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑥 ∈ 𝐴 ↔ ⟨𝑦, 𝑧⟩ ∈ 𝐴))
3		vex 3448	. . . . . . . . . . . 12 ⊢ 𝑧 ∈ V
4	3	biantru 529	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝐵 ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ V))
5		vex 3448	. . . . . . . . . . . . 13 ⊢ 𝑦 ∈ V
6	5, 3	opelrn 5896	. . . . . . . . . . . 12 ⊢ (⟨𝑦, 𝑧⟩ ∈ 𝐴 → 𝑧 ∈ ran 𝐴)
7	6	biantrud 531	. . . . . . . . . . 11 ⊢ (⟨𝑦, 𝑧⟩ ∈ 𝐴 → (𝑦 ∈ 𝐵 ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ ran 𝐴)))
8	4, 7	bitr3id 285	. . . . . . . . . 10 ⊢ (⟨𝑦, 𝑧⟩ ∈ 𝐴 → ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ V) ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ ran 𝐴)))
9	2, 8	biimtrdi 253	. . . . . . . . 9 ⊢ (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑥 ∈ 𝐴 → ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ V) ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ ran 𝐴))))
10	9	com12 32	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 → (𝑥 = ⟨𝑦, 𝑧⟩ → ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ V) ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ ran 𝐴))))
11	10	pm5.32d 577	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ V)) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ ran 𝐴))))
12	11	2exbidv 1924	. . . . . 6 ⊢ (𝑥 ∈ 𝐴 → (∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ V)) ↔ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ ran 𝐴))))
13		elxp 5654	. . . . . 6 ⊢ (𝑥 ∈ (𝐵 × V) ↔ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ V)))
14		elxp 5654	. . . . . 6 ⊢ (𝑥 ∈ (𝐵 × ran 𝐴) ↔ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ ran 𝐴)))
15	12, 13, 14	3bitr4g 314	. . . . 5 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ∈ (𝐵 × V) ↔ 𝑥 ∈ (𝐵 × ran 𝐴)))
16	15	pm5.32i 574	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × V)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × ran 𝐴)))
17		elin 3927	. . . 4 ⊢ (𝑥 ∈ (𝐴 ∩ (𝐵 × ran 𝐴)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × ran 𝐴)))
18	16, 17	bitr4i 278	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ (𝐵 × V)) ↔ 𝑥 ∈ (𝐴 ∩ (𝐵 × ran 𝐴)))
19	18	ineqri 4171	. 2 ⊢ (𝐴 ∩ (𝐵 × V)) = (𝐴 ∩ (𝐵 × ran 𝐴))
20	1, 19	eqtri 2752	1 ⊢ (𝐴 ↾ 𝐵) = (𝐴 ∩ (𝐵 × ran 𝐴))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109  Vcvv 3444   ∩ cin 3910  ⟨cop 4591   × cxp 5629  ran crn 5632   ↾ cres 5633

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5246  ax-nul 5256  ax-pr 5382

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-rab 3403  df-v 3446  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-sn 4586  df-pr 4588  df-op 4592  df-br 5103  df-opab 5165  df-xp 5637  df-cnv 5639  df-dm 5641  df-rn 5642  df-res 5643

This theorem is referenced by:  brrestrict  35910  dfrel6  38302