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 42834

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 8781	. . . 4 ⊢ (𝐴 ∈ (𝐵 ↑_m 𝐶) → 𝐴:𝐶⟶𝐵)
2		fco 6682	. . . 4 ⊢ ((𝐴:𝐶⟶𝐵 ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷):𝐸⟶𝐵)
3	1, 2	sylan 580	. . 3 ⊢ ((𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷):𝐸⟶𝐵)
4	3	3adant1 1130	. 2 ⊢ ((𝐸 ∈ V ∧ 𝐴 ∈ (𝐵 ↑_m 𝐶) ∧ 𝐷:𝐸⟶𝐶) → (𝐴 ∘ 𝐷):𝐸⟶𝐵)
5		n0i 4289	. . . . 5 ⊢ (𝐴 ∈ (𝐵 ↑_m 𝐶) → ¬ (𝐵 ↑_m 𝐶) = ∅)
6		reldmmap 8767	. . . . . 6 ⊢ Rel dom ↑_m
7	6	ovprc1 7393	. . . . 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 8772	. 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 1541 ∈ wcel 2113 Vcvv 3437 ∅c0 4282 ∘ ccom 5625 ⟶wf 6484 (class class class)co 7354 ↑_m cmap 8758

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 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7676

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 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-fv 6496 df-ov 7357 df-oprab 7358 df-mpo 7359 df-1st 7929 df-2nd 7930 df-map 8760

This theorem is referenced by: mapco2 42835 eldioph2 42882

W3C validator