fncoOLD - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > fncoOLD		Structured version Visualization version GIF version

Theorem fncoOLD 6550

Description: Obsolete version of fnco 6549 as of 20-Sep-2024. (Contributed by NM, 22-May-2006.) (Proof modification is discouraged.) (New usage is discouraged.)

**Assertion**
Ref	Expression
fncoOLD	⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → (𝐹 ∘ 𝐺) Fn 𝐵)

**Proof of Theorem fncoOLD**
Step	Hyp	Ref	Expression
1		fnfun 6533	. . . 4 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
2		fnfun 6533	. . . 4 ⊢ (𝐺 Fn 𝐵 → Fun 𝐺)
3		funco 6474	. . . 4 ⊢ ((Fun 𝐹 ∧ Fun 𝐺) → Fun (𝐹 ∘ 𝐺))
4	1, 2, 3	syl2an 596	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵) → Fun (𝐹 ∘ 𝐺))
5	4	3adant3 1131	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → Fun (𝐹 ∘ 𝐺))
6		fndm 6536	. . . . . . 7 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
7	6	sseq2d 3953	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → (ran 𝐺 ⊆ dom 𝐹 ↔ ran 𝐺 ⊆ 𝐴))
8	7	biimpar 478	. . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ ran 𝐺 ⊆ 𝐴) → ran 𝐺 ⊆ dom 𝐹)
9		dmcosseq 5882	. . . . 5 ⊢ (ran 𝐺 ⊆ dom 𝐹 → dom (𝐹 ∘ 𝐺) = dom 𝐺)
10	8, 9	syl 17	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ ran 𝐺 ⊆ 𝐴) → dom (𝐹 ∘ 𝐺) = dom 𝐺)
11	10	3adant2 1130	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → dom (𝐹 ∘ 𝐺) = dom 𝐺)
12		fndm 6536	. . . 4 ⊢ (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
13	12	3ad2ant2 1133	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → dom 𝐺 = 𝐵)
14	11, 13	eqtrd 2778	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → dom (𝐹 ∘ 𝐺) = 𝐵)
15		df-fn 6436	. 2 ⊢ ((𝐹 ∘ 𝐺) Fn 𝐵 ↔ (Fun (𝐹 ∘ 𝐺) ∧ dom (𝐹 ∘ 𝐺) = 𝐵))
16	5, 14, 15	sylanbrc 583	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ ran 𝐺 ⊆ 𝐴) → (𝐹 ∘ 𝐺) Fn 𝐵)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ⊆ wss 3887 dom cdm 5589 ran crn 5590 ∘ ccom 5593 Fun wfun 6427 Fn wfn 6428

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 df-opab 5137 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-fun 6435 df-fn 6436

This theorem is referenced by: (None)

W3C validator