Theorem respreima 7067

Description: The preimage of a restricted function. (Contributed by Jeff Madsen, 2-Sep-2009.)

Assertion

Ref	Expression
respreima	⊢ (Fun 𝐹 → (◡(𝐹 ↾ 𝐵) “ 𝐴) = ((◡𝐹 “ 𝐴) ∩ 𝐵))

Proof of Theorem respreima

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funfn 6578	. . 3 ⊢ (Fun 𝐹 ↔ 𝐹 Fn dom 𝐹)
2		elin 3964	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐵 ∩ dom 𝐹) ↔ (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ dom 𝐹))
3	2	biancomi 463	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐵 ∩ dom 𝐹) ↔ (𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵))
4	3	anbi1i 624	. . . . . . 7 ⊢ ((𝑥 ∈ (𝐵 ∩ dom 𝐹) ∧ ((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐴) ↔ ((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) ∧ ((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐴))
5		fvres 6910	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝑥) = (𝐹‘𝑥))
6	5	eleq1d 2818	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 → (((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐴 ↔ (𝐹‘𝑥) ∈ 𝐴))
7	6	adantl 482	. . . . . . . 8 ⊢ ((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) → (((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐴 ↔ (𝐹‘𝑥) ∈ 𝐴))
8	7	pm5.32i 575	. . . . . . 7 ⊢ (((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) ∧ ((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐴) ↔ ((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) ∧ (𝐹‘𝑥) ∈ 𝐴))
9	4, 8	bitri 274	. . . . . 6 ⊢ ((𝑥 ∈ (𝐵 ∩ dom 𝐹) ∧ ((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐴) ↔ ((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) ∧ (𝐹‘𝑥) ∈ 𝐴))
10	9	a1i 11	. . . . 5 ⊢ (𝐹 Fn dom 𝐹 → ((𝑥 ∈ (𝐵 ∩ dom 𝐹) ∧ ((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐴) ↔ ((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) ∧ (𝐹‘𝑥) ∈ 𝐴)))
11		an32 644	. . . . 5 ⊢ (((𝑥 ∈ dom 𝐹 ∧ 𝑥 ∈ 𝐵) ∧ (𝐹‘𝑥) ∈ 𝐴) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∧ 𝑥 ∈ 𝐵))
12	10, 11	bitrdi 286	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → ((𝑥 ∈ (𝐵 ∩ dom 𝐹) ∧ ((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐴) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∧ 𝑥 ∈ 𝐵)))
13		fnfun 6649	. . . . . . 7 ⊢ (𝐹 Fn dom 𝐹 → Fun 𝐹)
14	13	funresd 6591	. . . . . 6 ⊢ (𝐹 Fn dom 𝐹 → Fun (𝐹 ↾ 𝐵))
15		dmres 6003	. . . . . 6 ⊢ dom (𝐹 ↾ 𝐵) = (𝐵 ∩ dom 𝐹)
16		df-fn 6546	. . . . . 6 ⊢ ((𝐹 ↾ 𝐵) Fn (𝐵 ∩ dom 𝐹) ↔ (Fun (𝐹 ↾ 𝐵) ∧ dom (𝐹 ↾ 𝐵) = (𝐵 ∩ dom 𝐹)))
17	14, 15, 16	sylanblrc 590	. . . . 5 ⊢ (𝐹 Fn dom 𝐹 → (𝐹 ↾ 𝐵) Fn (𝐵 ∩ dom 𝐹))
18		elpreima 7059	. . . . 5 ⊢ ((𝐹 ↾ 𝐵) Fn (𝐵 ∩ dom 𝐹) → (𝑥 ∈ (◡(𝐹 ↾ 𝐵) “ 𝐴) ↔ (𝑥 ∈ (𝐵 ∩ dom 𝐹) ∧ ((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐴)))
19	17, 18	syl 17	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡(𝐹 ↾ 𝐵) “ 𝐴) ↔ (𝑥 ∈ (𝐵 ∩ dom 𝐹) ∧ ((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐴)))
20		elin 3964	. . . . 5 ⊢ (𝑥 ∈ ((◡𝐹 “ 𝐴) ∩ 𝐵) ↔ (𝑥 ∈ (◡𝐹 “ 𝐴) ∧ 𝑥 ∈ 𝐵))
21		elpreima 7059	. . . . . 6 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡𝐹 “ 𝐴) ↔ (𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴)))
22	21	anbi1d 630	. . . . 5 ⊢ (𝐹 Fn dom 𝐹 → ((𝑥 ∈ (◡𝐹 “ 𝐴) ∧ 𝑥 ∈ 𝐵) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∧ 𝑥 ∈ 𝐵)))
23	20, 22	bitrid 282	. . . 4 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ ((◡𝐹 “ 𝐴) ∩ 𝐵) ↔ ((𝑥 ∈ dom 𝐹 ∧ (𝐹‘𝑥) ∈ 𝐴) ∧ 𝑥 ∈ 𝐵)))
24	12, 19, 23	3bitr4d 310	. . 3 ⊢ (𝐹 Fn dom 𝐹 → (𝑥 ∈ (◡(𝐹 ↾ 𝐵) “ 𝐴) ↔ 𝑥 ∈ ((◡𝐹 “ 𝐴) ∩ 𝐵)))
25	1, 24	sylbi 216	. 2 ⊢ (Fun 𝐹 → (𝑥 ∈ (◡(𝐹 ↾ 𝐵) “ 𝐴) ↔ 𝑥 ∈ ((◡𝐹 “ 𝐴) ∩ 𝐵)))
26	25	eqrdv 2730	1 ⊢ (Fun 𝐹 → (◡(𝐹 ↾ 𝐵) “ 𝐴) = ((◡𝐹 “ 𝐴) ∩ 𝐵))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106   ∩ cin 3947  ^◡ccnv 5675  dom cdm 5676   ↾ cres 5678   “ cima 5679  Fun wfun 6537   Fn wfn 6538  ‘cfv 6543

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-iota 6495  df-fun 6545  df-fn 6546  df-fv 6551

This theorem is referenced by:  paste  22805  restmetu  24086  eulerpartlemt  33439  smfres  45585