Theorem fullthinc2 50693

Description: A full functor to a thin category maps empty hom-sets to empty hom-sets. (Contributed by Zhi Wang, 1-Oct-2024.)

Hypotheses

Ref	Expression
fullthinc.b	⊢ 𝐵 = (Base‘𝐶)
fullthinc.j	⊢ 𝐽 = (Hom ‘𝐷)
fullthinc.h	⊢ 𝐻 = (Hom ‘𝐶)
fullthinc.d	⊢ (𝜑 → 𝐷 ∈ ThinCat)
fullthinc2.f	⊢ (𝜑 → 𝐹(𝐶 Full 𝐷)𝐺)
fullthinc2.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
fullthinc2.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)

Assertion

Ref	Expression
fullthinc2	⊢ (𝜑 → ((𝑋𝐻𝑌) = ∅ ↔ ((𝐹‘𝑋)𝐽(𝐹‘𝑌)) = ∅))

Proof of Theorem fullthinc2

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fullthinc2.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
2		fullthinc2.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
3		fullthinc2.f	. . . 4 ⊢ (𝜑 → 𝐹(𝐶 Full 𝐷)𝐺)
4		fullthinc.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐶)
5		fullthinc.j	. . . . 5 ⊢ 𝐽 = (Hom ‘𝐷)
6		fullthinc.h	. . . . 5 ⊢ 𝐻 = (Hom ‘𝐶)
7		fullthinc.d	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ ThinCat)
8		fullfunc 18090	. . . . . . 7 ⊢ (𝐶 Full 𝐷) ⊆ (𝐶 Func 𝐷)
9	8	ssbri 5149	. . . . . 6 ⊢ (𝐹(𝐶 Full 𝐷)𝐺 → 𝐹(𝐶 Func 𝐷)𝐺)
10	3, 9	syl 18	. . . . 5 ⊢ (𝜑 → 𝐹(𝐶 Func 𝐷)𝐺)
11	4, 5, 6, 7, 10	fullthinc 50692	. . . 4 ⊢ (𝜑 → (𝐹(𝐶 Full 𝐷)𝐺 ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥𝐻𝑦) = ∅ → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ∅)))
12	3, 11	mpbid 235	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥𝐻𝑦) = ∅ → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ∅))
13		oveq12 7431	. . . . . . 7 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝑥𝐻𝑦) = (𝑋𝐻𝑌))
14	13	eqeq1d 2762	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((𝑥𝐻𝑦) = ∅ ↔ (𝑋𝐻𝑌) = ∅))
15		simpl 488	. . . . . . . . 9 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝑥 = 𝑋)
16	15	fveq2d 6892	. . . . . . . 8 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝐹‘𝑥) = (𝐹‘𝑋))
17		simpr 490	. . . . . . . . 9 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → 𝑦 = 𝑌)
18	17	fveq2d 6892	. . . . . . . 8 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (𝐹‘𝑦) = (𝐹‘𝑌))
19	16, 18	oveq12d 7440	. . . . . . 7 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ((𝐹‘𝑋)𝐽(𝐹‘𝑌)))
20	19	eqeq1d 2762	. . . . . 6 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ∅ ↔ ((𝐹‘𝑋)𝐽(𝐹‘𝑌)) = ∅))
21	14, 20	imbi12d 347	. . . . 5 ⊢ ((𝑥 = 𝑋 ∧ 𝑦 = 𝑌) → (((𝑥𝐻𝑦) = ∅ → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ∅) ↔ ((𝑋𝐻𝑌) = ∅ → ((𝐹‘𝑋)𝐽(𝐹‘𝑌)) = ∅)))
22	21	rspc2gv 3585	. . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥𝐻𝑦) = ∅ → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ∅) → ((𝑋𝐻𝑌) = ∅ → ((𝐹‘𝑋)𝐽(𝐹‘𝑌)) = ∅)))
23	22	imp 412	. . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥𝐻𝑦) = ∅ → ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) = ∅)) → ((𝑋𝐻𝑌) = ∅ → ((𝐹‘𝑋)𝐽(𝐹‘𝑌)) = ∅))
24	1, 2, 12, 23	syl21anc 851	. 2 ⊢ (𝜑 → ((𝑋𝐻𝑌) = ∅ → ((𝐹‘𝑋)𝐽(𝐹‘𝑌)) = ∅))
25	4, 6, 5, 10, 1, 2	funcf2 18050	. . 3 ⊢ (𝜑 → (𝑋𝐺𝑌):(𝑋𝐻𝑌)⟶((𝐹‘𝑋)𝐽(𝐹‘𝑌)))
26	25	f002 50072	. 2 ⊢ (𝜑 → (((𝐹‘𝑋)𝐽(𝐹‘𝑌)) = ∅ → (𝑋𝐻𝑌) = ∅))
27	24, 26	impbid 215	1 ⊢ (𝜑 → ((𝑋𝐻𝑌) = ∅ ↔ ((𝐹‘𝑋)𝐽(𝐹‘𝑌)) = ∅))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∅c0 4277   class class class wbr 5102  ‘cfv 6541  (class class class)co 7422  Basecbs 17394  Hom chom 17446   Func cfunc 18036   Full cful 18086  ThinCatcthinc 50659

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7753

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-ov 7425  df-oprab 7426  df-mpo 7427  df-1st 8003  df-2nd 8004  df-map 8854  df-ixp 8931  df-func 18040  df-full 18088  df-thinc 50660

This theorem is used by: (None)