Theorem maprnin 32714

Description: Restricting the range of the mapping operator. (Contributed by Thierry Arnoux, 30-Aug-2017.)

Hypotheses

Ref	Expression
maprnin.1	⊢ 𝐴 ∈ V
maprnin.2	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
maprnin	⊢ ((𝐵 ∩ 𝐶) ↑m 𝐴) = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ran 𝑓 ⊆ 𝐶}

Distinct variable groups:   𝐴,𝑓   𝐵,𝑓   𝐶,𝑓

Proof of Theorem maprnin

Step	Hyp	Ref	Expression
1		ffn 6651	. . . . . 6 ⊢ (𝑓:𝐴⟶𝐵 → 𝑓 Fn 𝐴)
2		df-f 6485	. . . . . . 7 ⊢ (𝑓:𝐴⟶𝐶 ↔ (𝑓 Fn 𝐴 ∧ ran 𝑓 ⊆ 𝐶))
3	2	baibr 536	. . . . . 6 ⊢ (𝑓 Fn 𝐴 → (ran 𝑓 ⊆ 𝐶 ↔ 𝑓:𝐴⟶𝐶))
4	1, 3	syl 17	. . . . 5 ⊢ (𝑓:𝐴⟶𝐵 → (ran 𝑓 ⊆ 𝐶 ↔ 𝑓:𝐴⟶𝐶))
5	4	pm5.32i 574	. . . 4 ⊢ ((𝑓:𝐴⟶𝐵 ∧ ran 𝑓 ⊆ 𝐶) ↔ (𝑓:𝐴⟶𝐵 ∧ 𝑓:𝐴⟶𝐶))
6		maprnin.2	. . . . . 6 ⊢ 𝐵 ∈ V
7		maprnin.1	. . . . . 6 ⊢ 𝐴 ∈ V
8	6, 7	elmap 8795	. . . . 5 ⊢ (𝑓 ∈ (𝐵 ↑m 𝐴) ↔ 𝑓:𝐴⟶𝐵)
9	8	anbi1i 624	. . . 4 ⊢ ((𝑓 ∈ (𝐵 ↑m 𝐴) ∧ ran 𝑓 ⊆ 𝐶) ↔ (𝑓:𝐴⟶𝐵 ∧ ran 𝑓 ⊆ 𝐶))
10		fin 6703	. . . 4 ⊢ (𝑓:𝐴⟶(𝐵 ∩ 𝐶) ↔ (𝑓:𝐴⟶𝐵 ∧ 𝑓:𝐴⟶𝐶))
11	5, 9, 10	3bitr4ri 304	. . 3 ⊢ (𝑓:𝐴⟶(𝐵 ∩ 𝐶) ↔ (𝑓 ∈ (𝐵 ↑m 𝐴) ∧ ran 𝑓 ⊆ 𝐶))
12	11	abbii 2798	. 2 ⊢ {𝑓 ∣ 𝑓:𝐴⟶(𝐵 ∩ 𝐶)} = {𝑓 ∣ (𝑓 ∈ (𝐵 ↑m 𝐴) ∧ ran 𝑓 ⊆ 𝐶)}
13	6	inex1 5253	. . 3 ⊢ (𝐵 ∩ 𝐶) ∈ V
14	13, 7	mapval 8762	. 2 ⊢ ((𝐵 ∩ 𝐶) ↑m 𝐴) = {𝑓 ∣ 𝑓:𝐴⟶(𝐵 ∩ 𝐶)}
15		df-rab 3396	. 2 ⊢ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ran 𝑓 ⊆ 𝐶} = {𝑓 ∣ (𝑓 ∈ (𝐵 ↑m 𝐴) ∧ ran 𝑓 ⊆ 𝐶)}
16	12, 14, 15	3eqtr4i 2764	1 ⊢ ((𝐵 ∩ 𝐶) ↑m 𝐴) = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ ran 𝑓 ⊆ 𝐶}

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2111  {cab 2709  {crab 3395  Vcvv 3436   ∩ cin 3896   ⊆ wss 3897  ran crn 5615   Fn wfn 6476  ⟶wf 6477  (class class class)co 7346   ↑_m cmap 8750

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-sbc 3737  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-map 8752

This theorem is referenced by:  fpwrelmapffs  32717