Theorem brcoffn 44019

Description: Conditions allowing the decomposition of a binary relation. (Contributed by RP, 7-Jun-2021.)

Hypotheses

Ref	Expression
brcoffn.c	⊢ (𝜑 → 𝐶 Fn 𝑌)
brcoffn.d	⊢ (𝜑 → 𝐷:𝑋⟶𝑌)
brcoffn.r	⊢ (𝜑 → 𝐴(𝐶 ∘ 𝐷)𝐵)

Assertion

Ref	Expression
brcoffn	⊢ (𝜑 → (𝐴𝐷(𝐷‘𝐴) ∧ (𝐷‘𝐴)𝐶𝐵))

Proof of Theorem brcoffn

Step	Hyp	Ref	Expression
1		brcoffn.c	. . . 4 ⊢ (𝜑 → 𝐶 Fn 𝑌)
2		brcoffn.d	. . . 4 ⊢ (𝜑 → 𝐷:𝑋⟶𝑌)
3		fnfco 6725	. . . 4 ⊢ ((𝐶 Fn 𝑌 ∧ 𝐷:𝑋⟶𝑌) → (𝐶 ∘ 𝐷) Fn 𝑋)
4	1, 2, 3	syl2anc 584	. . 3 ⊢ (𝜑 → (𝐶 ∘ 𝐷) Fn 𝑋)
5		simpl 482	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋) → 𝜑)
6		simpr 484	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋) → (𝐶 ∘ 𝐷) Fn 𝑋)
7		brcoffn.r	. . . . . 6 ⊢ (𝜑 → 𝐴(𝐶 ∘ 𝐷)𝐵)
8	5, 7	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋) → 𝐴(𝐶 ∘ 𝐷)𝐵)
9		fnbr 6626	. . . . 5 ⊢ (((𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴(𝐶 ∘ 𝐷)𝐵) → 𝐴 ∈ 𝑋)
10	6, 8, 9	syl2anc 584	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋) → 𝐴 ∈ 𝑋)
11	5, 6, 10	3jca 1128	. . 3 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋) → (𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋))
12	4, 11	mpdan 687	. 2 ⊢ (𝜑 → (𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋))
13	2	3ad2ant1 1133	. . . . . 6 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐷:𝑋⟶𝑌)
14		simp3 1138	. . . . . 6 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴 ∈ 𝑋)
15		fvco3 6960	. . . . . 6 ⊢ ((𝐷:𝑋⟶𝑌 ∧ 𝐴 ∈ 𝑋) → ((𝐶 ∘ 𝐷)‘𝐴) = (𝐶‘(𝐷‘𝐴)))
16	13, 14, 15	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐶 ∘ 𝐷)‘𝐴) = (𝐶‘(𝐷‘𝐴)))
17	7	3ad2ant1 1133	. . . . . 6 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐴(𝐶 ∘ 𝐷)𝐵)
18		fnbrfvb 6911	. . . . . . 7 ⊢ (((𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (((𝐶 ∘ 𝐷)‘𝐴) = 𝐵 ↔ 𝐴(𝐶 ∘ 𝐷)𝐵))
19	18	3adant1 1130	. . . . . 6 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (((𝐶 ∘ 𝐷)‘𝐴) = 𝐵 ↔ 𝐴(𝐶 ∘ 𝐷)𝐵))
20	17, 19	mpbird 257	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐶 ∘ 𝐷)‘𝐴) = 𝐵)
21	16, 20	eqtr3d 2766	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐶‘(𝐷‘𝐴)) = 𝐵)
22		eqid 2729	. . . 4 ⊢ (𝐷‘𝐴) = (𝐷‘𝐴)
23	21, 22	jctil 519	. . 3 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐷‘𝐴) = (𝐷‘𝐴) ∧ (𝐶‘(𝐷‘𝐴)) = 𝐵))
24	13	ffnd 6689	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐷 Fn 𝑋)
25		fnbrfvb 6911	. . . . 5 ⊢ ((𝐷 Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐷‘𝐴) = (𝐷‘𝐴) ↔ 𝐴𝐷(𝐷‘𝐴)))
26	24, 14, 25	syl2anc 584	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐷‘𝐴) = (𝐷‘𝐴) ↔ 𝐴𝐷(𝐷‘𝐴)))
27	1	3ad2ant1 1133	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐶 Fn 𝑌)
28	13, 14	ffvelcdmd 7057	. . . . 5 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐷‘𝐴) ∈ 𝑌)
29		fnbrfvb 6911	. . . . 5 ⊢ ((𝐶 Fn 𝑌 ∧ (𝐷‘𝐴) ∈ 𝑌) → ((𝐶‘(𝐷‘𝐴)) = 𝐵 ↔ (𝐷‘𝐴)𝐶𝐵))
30	27, 28, 29	syl2anc 584	. . . 4 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐶‘(𝐷‘𝐴)) = 𝐵 ↔ (𝐷‘𝐴)𝐶𝐵))
31	26, 30	anbi12d 632	. . 3 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (((𝐷‘𝐴) = (𝐷‘𝐴) ∧ (𝐶‘(𝐷‘𝐴)) = 𝐵) ↔ (𝐴𝐷(𝐷‘𝐴) ∧ (𝐷‘𝐴)𝐶𝐵)))
32	23, 31	mpbid 232	. 2 ⊢ ((𝜑 ∧ (𝐶 ∘ 𝐷) Fn 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴𝐷(𝐷‘𝐴) ∧ (𝐷‘𝐴)𝐶𝐵))
33	12, 32	syl 17	1 ⊢ (𝜑 → (𝐴𝐷(𝐷‘𝐴) ∧ (𝐷‘𝐴)𝐶𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   class class class wbr 5107   ∘ ccom 5642   Fn wfn 6506  ⟶wf 6507  ‘cfv 6511

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-pr 5387

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-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  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

This theorem is referenced by:  brcofffn  44020  brco2f1o  44021  clsneikex  44095  clsneinex  44096  clsneiel1  44097