k0004lem2 - Mathbox for Richard Penner

	Mathbox for Richard Penner		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > k0004lem2		Structured version Visualization version GIF version

Theorem k0004lem2 40851

Description: A mapping with a particular restricted range is also a mapping to that range. (Contributed by RP, 1-Apr-2021.)

**Assertion**
Ref	Expression
k0004lem2	⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ⊆ 𝐵) → ((𝐹 ∈ (𝐵 ↑_m 𝐴) ∧ (𝐹 “ 𝐴) ⊆ 𝐶) ↔ 𝐹 ∈ (𝐶 ↑_m 𝐴)))

**Proof of Theorem k0004lem2**
Step	Hyp	Ref	Expression
1		simp3 1135	. . 3 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ⊆ 𝐵) → 𝐶 ⊆ 𝐵)
2		sseqin2 4142	. . . . 5 ⊢ (𝐶 ⊆ 𝐵 ↔ (𝐵 ∩ 𝐶) = 𝐶)
3	2	biimpi 219	. . . 4 ⊢ (𝐶 ⊆ 𝐵 → (𝐵 ∩ 𝐶) = 𝐶)
4	3	eqcomd 2804	. . 3 ⊢ (𝐶 ⊆ 𝐵 → 𝐶 = (𝐵 ∩ 𝐶))
5		k0004lem1 40850	. . 3 ⊢ (𝐶 = (𝐵 ∩ 𝐶) → ((𝐹:𝐴⟶𝐵 ∧ (𝐹 “ 𝐴) ⊆ 𝐶) ↔ 𝐹:𝐴⟶𝐶))
6	1, 4, 5	3syl 18	. 2 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ⊆ 𝐵) → ((𝐹:𝐴⟶𝐵 ∧ (𝐹 “ 𝐴) ⊆ 𝐶) ↔ 𝐹:𝐴⟶𝐶))
7		simp2 1134	. . . 4 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ⊆ 𝐵) → 𝐵 ∈ 𝑉)
8		simp1 1133	. . . 4 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ⊆ 𝐵) → 𝐴 ∈ 𝑈)
9	7, 8	elmapd 8403	. . 3 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ⊆ 𝐵) → (𝐹 ∈ (𝐵 ↑_m 𝐴) ↔ 𝐹:𝐴⟶𝐵))
10	9	anbi1d 632	. 2 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ⊆ 𝐵) → ((𝐹 ∈ (𝐵 ↑_m 𝐴) ∧ (𝐹 “ 𝐴) ⊆ 𝐶) ↔ (𝐹:𝐴⟶𝐵 ∧ (𝐹 “ 𝐴) ⊆ 𝐶)))
11	7, 1	ssexd 5192	. . 3 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ⊆ 𝐵) → 𝐶 ∈ V)
12	11, 8	elmapd 8403	. 2 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ⊆ 𝐵) → (𝐹 ∈ (𝐶 ↑_m 𝐴) ↔ 𝐹:𝐴⟶𝐶))
13	6, 10, 12	3bitr4d 314	1 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉 ∧ 𝐶 ⊆ 𝐵) → ((𝐹 ∈ (𝐵 ↑_m 𝐴) ∧ (𝐹 “ 𝐴) ⊆ 𝐶) ↔ 𝐹 ∈ (𝐶 ↑_m 𝐴)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 Vcvv 3441 ∩ cin 3880 ⊆ wss 3881 “ cima 5522 ⟶wf 6320 (class class class)co 7135 ↑_m cmap 8389

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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-map 8391

This theorem is referenced by: k0004lem3 40852

W3C validator