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 42702

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 8822	. . . 4 ⊢ (𝐴 ∈ (𝐵 ↑_m 𝐶) → 𝐴:𝐶⟶𝐵)
2		fco 6712	. . . 4 ⊢ ((𝐴:𝐶⟶𝐵 ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷):𝐸⟶𝐵)
3	1, 2	sylan 580	. . 3 ⊢ ((𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷):𝐸⟶𝐵)
4	3	3adant1 1130	. 2 ⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷):𝐸⟶𝐵)
5		n0i 4303	. . . . 5 ⊢ (𝐴 ∈ (𝐵 ↑_m 𝐶) → ¬ (𝐵 ↑_m 𝐶) = ∅)
6		reldmmap 8808	. . . . . 6 ⊢ Rel dom ↑_m
7	6	ovprc1 7426	. . . . 5 ⊢ (¬ 𝐵 ∈ V → (𝐵 ↑_m 𝐶) = ∅)
8	5, 7	nsyl2 141	. . . 4 ⊢ (𝐴 ∈ (𝐵 ↑_m 𝐶) → 𝐵 ∈ V)
9	8	3ad2ant2 1134	. . 3 ⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → 𝐵 ∈ V)
10		simp1 1136	. . 3 ⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → 𝐸 ∈ V)
11	9, 10	elmapd 8813	. 2 ⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → ((𝐴 ∘ 𝐷) ∈ (𝐵 ↑_m 𝐸) ↔ (𝐴 ∘ 𝐷):𝐸⟶𝐵))
12	4, 11	mpbird 257	1 ⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷) ∈ (𝐵 ↑_m 𝐸))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 Vcvv 3447 ∅c0 4296 ∘ ccom 5642 ⟶wf 6507 (class class class)co 7387 ↑_m cmap 8799

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-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711

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-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-1st 7968 df-2nd 7969 df-map 8801

This theorem is referenced by: mapco2 42703 eldioph2 42750

W3C validator