Theorem nelsubclem 49049

Description: Lemma for nelsubc 49050. (Contributed by Zhi Wang, 5-Nov-2025.)

Hypotheses

Ref	Expression
nelsubc.b	⊢ 𝐵 = (Base‘𝐶)
nelsubc.s	⊢ (𝜑 → 𝑆 ⊆ 𝐵)
nelsubc.0	⊢ (𝜑 → 𝑆 ≠ ∅)
nelsubc.j	⊢ (𝜑 → 𝐽 = ((𝑆 × 𝑆) × {∅}))
nelsubc.h	⊢ 𝐻 = (Homf ‘𝐶)

Assertion

Ref	Expression
nelsubclem	⊢ (𝜑 → (𝐽 Fn (𝑆 × 𝑆) ∧ (𝐽 ⊆cat 𝐻 ∧ (¬ ∀𝑥 ∈ 𝑆 𝐼 ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)𝜓))))

Distinct variable groups:   𝑓,𝐽   𝑥,𝑆,𝑦,𝑧   𝑥,𝑓,𝑦   𝜑,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑓)   𝜓(𝑥,𝑦,𝑧,𝑓)   𝐵(𝑥,𝑦,𝑧,𝑓)   𝐶(𝑥,𝑦,𝑧,𝑓)   𝑆(𝑓)   𝐻(𝑥,𝑦,𝑧,𝑓)   𝐼(𝑥,𝑦,𝑧,𝑓)   𝐽(𝑥,𝑦,𝑧)

Proof of Theorem nelsubclem

Dummy variables 𝑝 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		0ex 5257	. . . 4 ⊢ ∅ ∈ V
2		fnconstg 6730	. . . 4 ⊢ (∅ ∈ V → ((𝑆 × 𝑆) × {∅}) Fn (𝑆 × 𝑆))
3	1, 2	ax-mp 5	. . 3 ⊢ ((𝑆 × 𝑆) × {∅}) Fn (𝑆 × 𝑆)
4		nelsubc.j	. . . 4 ⊢ (𝜑 → 𝐽 = ((𝑆 × 𝑆) × {∅}))
5	4	fneq1d 6593	. . 3 ⊢ (𝜑 → (𝐽 Fn (𝑆 × 𝑆) ↔ ((𝑆 × 𝑆) × {∅}) Fn (𝑆 × 𝑆)))
6	3, 5	mpbiri 258	. 2 ⊢ (𝜑 → 𝐽 Fn (𝑆 × 𝑆))
7		nelsubc.s	. . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
8	4	oveqd 7386	. . . . . 6 ⊢ (𝜑 → (𝑝𝐽𝑞) = (𝑝((𝑆 × 𝑆) × {∅})𝑞))
9	1	ovconst2 7549	. . . . . 6 ⊢ ((𝑝 ∈ 𝑆 ∧ 𝑞 ∈ 𝑆) → (𝑝((𝑆 × 𝑆) × {∅})𝑞) = ∅)
10	8, 9	sylan9eq 2784	. . . . 5 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝑆 ∧ 𝑞 ∈ 𝑆)) → (𝑝𝐽𝑞) = ∅)
11		0ss 4359	. . . . 5 ⊢ ∅ ⊆ (𝑝𝐻𝑞)
12	10, 11	eqsstrdi 3988	. . . 4 ⊢ ((𝜑 ∧ (𝑝 ∈ 𝑆 ∧ 𝑞 ∈ 𝑆)) → (𝑝𝐽𝑞) ⊆ (𝑝𝐻𝑞))
13	12	ralrimivva 3178	. . 3 ⊢ (𝜑 → ∀𝑝 ∈ 𝑆 ∀𝑞 ∈ 𝑆 (𝑝𝐽𝑞) ⊆ (𝑝𝐻𝑞))
14		nelsubc.h	. . . . . 6 ⊢ 𝐻 = (Homf ‘𝐶)
15		nelsubc.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐶)
16	14, 15	homffn 17634	. . . . 5 ⊢ 𝐻 Fn (𝐵 × 𝐵)
17	16	a1i 11	. . . 4 ⊢ (𝜑 → 𝐻 Fn (𝐵 × 𝐵))
18	15	fvexi 6854	. . . . 5 ⊢ 𝐵 ∈ V
19	18	a1i 11	. . . 4 ⊢ (𝜑 → 𝐵 ∈ V)
20	6, 17, 19	isssc 17762	. . 3 ⊢ (𝜑 → (𝐽 ⊆cat 𝐻 ↔ (𝑆 ⊆ 𝐵 ∧ ∀𝑝 ∈ 𝑆 ∀𝑞 ∈ 𝑆 (𝑝𝐽𝑞) ⊆ (𝑝𝐻𝑞))))
21	7, 13, 20	mpbir2and 713	. 2 ⊢ (𝜑 → 𝐽 ⊆cat 𝐻)
22		nelsubc.0	. . . . 5 ⊢ (𝜑 → 𝑆 ≠ ∅)
23	4	oveqd 7386	. . . . . . . 8 ⊢ (𝜑 → (𝑥𝐽𝑥) = (𝑥((𝑆 × 𝑆) × {∅})𝑥))
24	1	ovconst2 7549	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑥 ∈ 𝑆) → (𝑥((𝑆 × 𝑆) × {∅})𝑥) = ∅)
25	24	anidms 566	. . . . . . . 8 ⊢ (𝑥 ∈ 𝑆 → (𝑥((𝑆 × 𝑆) × {∅})𝑥) = ∅)
26	23, 25	sylan9eq 2784	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥𝐽𝑥) = ∅)
27		nel02 4298	. . . . . . 7 ⊢ ((𝑥𝐽𝑥) = ∅ → ¬ 𝐼 ∈ (𝑥𝐽𝑥))
28	26, 27	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → ¬ 𝐼 ∈ (𝑥𝐽𝑥))
29	28	reximdva0 4314	. . . . 5 ⊢ ((𝜑 ∧ 𝑆 ≠ ∅) → ∃𝑥 ∈ 𝑆 ¬ 𝐼 ∈ (𝑥𝐽𝑥))
30	22, 29	mpdan 687	. . . 4 ⊢ (𝜑 → ∃𝑥 ∈ 𝑆 ¬ 𝐼 ∈ (𝑥𝐽𝑥))
31		rexnal 3082	. . . 4 ⊢ (∃𝑥 ∈ 𝑆 ¬ 𝐼 ∈ (𝑥𝐽𝑥) ↔ ¬ ∀𝑥 ∈ 𝑆 𝐼 ∈ (𝑥𝐽𝑥))
32	30, 31	sylib 218	. . 3 ⊢ (𝜑 → ¬ ∀𝑥 ∈ 𝑆 𝐼 ∈ (𝑥𝐽𝑥))
33	4	oveqd 7386	. . . . . . 7 ⊢ (𝜑 → (𝑥𝐽𝑦) = (𝑥((𝑆 × 𝑆) × {∅})𝑦))
34	1	ovconst2 7549	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥((𝑆 × 𝑆) × {∅})𝑦) = ∅)
35	33, 34	sylan9eq 2784	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝐽𝑦) = ∅)
36		rzal 4468	. . . . . 6 ⊢ ((𝑥𝐽𝑦) = ∅ → ∀𝑓 ∈ (𝑥𝐽𝑦)𝜓)
37	35, 36	syl 17	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∀𝑓 ∈ (𝑥𝐽𝑦)𝜓)
38	37	ralrimivw 3129	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)𝜓)
39	38	ralrimivva 3178	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)𝜓)
40	32, 39	jca 511	. 2 ⊢ (𝜑 → (¬ ∀𝑥 ∈ 𝑆 𝐼 ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)𝜓))
41	6, 21, 40	jca32 515	1 ⊢ (𝜑 → (𝐽 Fn (𝑆 × 𝑆) ∧ (𝐽 ⊆cat 𝐻 ∧ (¬ ∀𝑥 ∈ 𝑆 𝐼 ∈ (𝑥𝐽𝑥) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ∀𝑓 ∈ (𝑥𝐽𝑦)𝜓))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044  ∃wrex 3053  Vcvv 3444   ⊆ wss 3911  ∅c0 4292  {csn 4585   class class class wbr 5102   × cxp 5629   Fn wfn 6494  ‘cfv 6499  (class class class)co 7369  Basecbs 17155  Hom_f chomf 17607   ⊆_cat cssc 17749

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-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691

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-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7372  df-oprab 7373  df-mpo 7374  df-1st 7947  df-2nd 7948  df-ixp 8848  df-homf 17611  df-ssc 17752

This theorem is referenced by:  nelsubc  49050  nelsubc3  49053