mapco2g - Mathbox for Stefan O'Rear

	Mathbox for Stefan O'Rear		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > mapco2g		Structured version Visualization version GIF version

Theorem mapco2g 40452

Description: Renaming indices in a tuple, with sethood as antecedents. (Contributed by Stefan O'Rear, 9-Oct-2014.) (Revised by Mario Carneiro, 5-May-2015.)

**Assertion**
Ref	Expression
mapco2g	⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷) ∈ (𝐵 ↑_m 𝐸))

**Proof of Theorem mapco2g**
Step	Hyp	Ref	Expression
1		elmapi 8595	. . . 4 ⊢ (𝐴 ∈ (𝐵 ↑_m 𝐶) → 𝐴:𝐶⟶𝐵)
2		fco 6608	. . . 4 ⊢ ((𝐴:𝐶⟶𝐵 ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷):𝐸⟶𝐵)
3	1, 2	sylan 579	. . 3 ⊢ ((𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷):𝐸⟶𝐵)
4	3	3adant1 1128	. 2 ⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷):𝐸⟶𝐵)
5		n0i 4264	. . . . 5 ⊢ (𝐴 ∈ (𝐵 ↑_m 𝐶) → ¬ (𝐵 ↑_m 𝐶) = ∅)
6		reldmmap 8582	. . . . . 6 ⊢ Rel dom ↑_m
7	6	ovprc1 7294	. . . . 5 ⊢ (¬ 𝐵 ∈ V → (𝐵 ↑_m 𝐶) = ∅)
8	5, 7	nsyl2 141	. . . 4 ⊢ (𝐴 ∈ (𝐵 ↑_m 𝐶) → 𝐵 ∈ V)
9	8	3ad2ant2 1132	. . 3 ⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → 𝐵 ∈ V)
10		simp1 1134	. . 3 ⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → 𝐸 ∈ V)
11	9, 10	elmapd 8587	. 2 ⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → ((𝐴 ∘ 𝐷) ∈ (𝐵 ↑_m 𝐸) ↔ (𝐴 ∘ 𝐷):𝐸⟶𝐵))
12	4, 11	mpbird 256	1 ⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷) ∈ (𝐵 ↑_m 𝐸))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 Vcvv 3422 ∅c0 4253 ∘ ccom 5584 ⟶wf 6414 (class class class)co 7255 ↑_m cmap 8573

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-1st 7804 df-2nd 7805 df-map 8575

This theorem is referenced by: mapco2 40453 eldioph2 40500

W3C validator