Theorem f1cof1blem 47079

Description: Lemma for f1cof1b 47082 and focofob 47085. (Contributed by AV, 18-Sep-2024.)

Hypotheses

Ref	Expression
fcores.f	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
fcores.e	⊢ 𝐸 = (ran 𝐹 ∩ 𝐶)
fcores.p	⊢ 𝑃 = (◡𝐹 “ 𝐶)
fcores.x	⊢ 𝑋 = (𝐹 ↾ 𝑃)
fcores.g	⊢ (𝜑 → 𝐺:𝐶⟶𝐷)
fcores.y	⊢ 𝑌 = (𝐺 ↾ 𝐸)
f1cof1blem.s	⊢ (𝜑 → ran 𝐹 = 𝐶)

Assertion

Ref	Expression
f1cof1blem	⊢ (𝜑 → ((𝑃 = 𝐴 ∧ 𝐸 = 𝐶) ∧ (𝑋 = 𝐹 ∧ 𝑌 = 𝐺)))

Proof of Theorem f1cof1blem

Step	Hyp	Ref	Expression
1		fcores.p	. . . . 5 ⊢ 𝑃 = (◡𝐹 “ 𝐶)
2		f1cof1blem.s	. . . . . . 7 ⊢ (𝜑 → ran 𝐹 = 𝐶)
3	2	eqcomd 2736	. . . . . 6 ⊢ (𝜑 → 𝐶 = ran 𝐹)
4	3	imaeq2d 6034	. . . . 5 ⊢ (𝜑 → (◡𝐹 “ 𝐶) = (◡𝐹 “ ran 𝐹))
5	1, 4	eqtrid 2777	. . . 4 ⊢ (𝜑 → 𝑃 = (◡𝐹 “ ran 𝐹))
6		cnvimarndm 6057	. . . . 5 ⊢ (◡𝐹 “ ran 𝐹) = dom 𝐹
7		fcores.f	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
8	7	fdmd 6701	. . . . 5 ⊢ (𝜑 → dom 𝐹 = 𝐴)
9	6, 8	eqtrid 2777	. . . 4 ⊢ (𝜑 → (◡𝐹 “ ran 𝐹) = 𝐴)
10	5, 9	eqtrd 2765	. . 3 ⊢ (𝜑 → 𝑃 = 𝐴)
11		fcores.e	. . . 4 ⊢ 𝐸 = (ran 𝐹 ∩ 𝐶)
12		simpr 484	. . . . . . 7 ⊢ ((𝜑 ∧ ran 𝐹 = 𝐶) → ran 𝐹 = 𝐶)
13	12	ineq1d 4185	. . . . . 6 ⊢ ((𝜑 ∧ ran 𝐹 = 𝐶) → (ran 𝐹 ∩ 𝐶) = (𝐶 ∩ 𝐶))
14		inidm 4193	. . . . . 6 ⊢ (𝐶 ∩ 𝐶) = 𝐶
15	13, 14	eqtrdi 2781	. . . . 5 ⊢ ((𝜑 ∧ ran 𝐹 = 𝐶) → (ran 𝐹 ∩ 𝐶) = 𝐶)
16	2, 15	mpdan 687	. . . 4 ⊢ (𝜑 → (ran 𝐹 ∩ 𝐶) = 𝐶)
17	11, 16	eqtrid 2777	. . 3 ⊢ (𝜑 → 𝐸 = 𝐶)
18	10, 17	jca 511	. 2 ⊢ (𝜑 → (𝑃 = 𝐴 ∧ 𝐸 = 𝐶))
19		fcores.x	. . . 4 ⊢ 𝑋 = (𝐹 ↾ 𝑃)
20	5, 6	eqtrdi 2781	. . . . 5 ⊢ (𝜑 → 𝑃 = dom 𝐹)
21	20	reseq2d 5953	. . . 4 ⊢ (𝜑 → (𝐹 ↾ 𝑃) = (𝐹 ↾ dom 𝐹))
22	19, 21	eqtrid 2777	. . 3 ⊢ (𝜑 → 𝑋 = (𝐹 ↾ dom 𝐹))
23	7	freld 6697	. . . 4 ⊢ (𝜑 → Rel 𝐹)
24		resdm 6000	. . . 4 ⊢ (Rel 𝐹 → (𝐹 ↾ dom 𝐹) = 𝐹)
25	23, 24	syl 17	. . 3 ⊢ (𝜑 → (𝐹 ↾ dom 𝐹) = 𝐹)
26	22, 25	eqtrd 2765	. 2 ⊢ (𝜑 → 𝑋 = 𝐹)
27		fcores.y	. . . 4 ⊢ 𝑌 = (𝐺 ↾ 𝐸)
28		fcores.g	. . . . . . 7 ⊢ (𝜑 → 𝐺:𝐶⟶𝐷)
29	28	fdmd 6701	. . . . . 6 ⊢ (𝜑 → dom 𝐺 = 𝐶)
30	17, 29	eqtr4d 2768	. . . . 5 ⊢ (𝜑 → 𝐸 = dom 𝐺)
31	30	reseq2d 5953	. . . 4 ⊢ (𝜑 → (𝐺 ↾ 𝐸) = (𝐺 ↾ dom 𝐺))
32	27, 31	eqtrid 2777	. . 3 ⊢ (𝜑 → 𝑌 = (𝐺 ↾ dom 𝐺))
33	28	freld 6697	. . . 4 ⊢ (𝜑 → Rel 𝐺)
34		resdm 6000	. . . 4 ⊢ (Rel 𝐺 → (𝐺 ↾ dom 𝐺) = 𝐺)
35	33, 34	syl 17	. . 3 ⊢ (𝜑 → (𝐺 ↾ dom 𝐺) = 𝐺)
36	32, 35	eqtrd 2765	. 2 ⊢ (𝜑 → 𝑌 = 𝐺)
37	18, 26, 36	jca32 515	1 ⊢ (𝜑 → ((𝑃 = 𝐴 ∧ 𝐸 = 𝐶) ∧ (𝑋 = 𝐹 ∧ 𝑌 = 𝐺)))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∩ cin 3916  ^◡ccnv 5640  dom cdm 5641  ran crn 5642   ↾ cres 5643   “ cima 5644  Rel wrel 5646  ⟶wf 6510

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-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390

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-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-br 5111  df-opab 5173  df-xp 5647  df-rel 5648  df-cnv 5649  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-fun 6516  df-fn 6517  df-f 6518

This theorem is referenced by:  f1cof1b  47082