Theorem sscfn2 17986

Description: The subcategory subset relation is defined on functions with square domain. (Contributed by Mario Carneiro, 6-Jan-2017.)

Hypotheses

Ref	Expression
sscfn1.1	⊢ (𝜑 → 𝐻 ⊆cat 𝐽)
sscfn2.2	⊢ (𝜑 → 𝑇 = dom dom 𝐽)

Assertion

Ref	Expression
sscfn2	⊢ (𝜑 → 𝐽 Fn (𝑇 × 𝑇))

Proof of Theorem sscfn2

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

Step	Hyp	Ref	Expression
1		sscfn1.1	. . 3 ⊢ (𝜑 → 𝐻 ⊆cat 𝐽)
2		brssc 17982	. . 3 ⊢ (𝐻 ⊆cat 𝐽 ↔ ∃𝑡(𝐽 Fn (𝑡 × 𝑡) ∧ ∃𝑦 ∈ 𝒫 𝑡𝐻 ∈ X𝑥 ∈ (𝑦 × 𝑦)𝒫 (𝐽‘𝑥)))
3	1, 2	sylib 221	. 2 ⊢ (𝜑 → ∃𝑡(𝐽 Fn (𝑡 × 𝑡) ∧ ∃𝑦 ∈ 𝒫 𝑡𝐻 ∈ X𝑥 ∈ (𝑦 × 𝑦)𝒫 (𝐽‘𝑥)))
4		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 Fn (𝑡 × 𝑡)) → 𝐽 Fn (𝑡 × 𝑡))
5		sscfn2.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝑇 = dom dom 𝐽)
6	5	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐽 Fn (𝑡 × 𝑡)) → 𝑇 = dom dom 𝐽)
7		fndm 6640	. . . . . . . . . . . 12 ⊢ (𝐽 Fn (𝑡 × 𝑡) → dom 𝐽 = (𝑡 × 𝑡))
8	7	adantl 487	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐽 Fn (𝑡 × 𝑡)) → dom 𝐽 = (𝑡 × 𝑡))
9	8	dmeqd 5887	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐽 Fn (𝑡 × 𝑡)) → dom dom 𝐽 = dom (𝑡 × 𝑡))
10		dmxpid 5912	. . . . . . . . . 10 ⊢ dom (𝑡 × 𝑡) = 𝑡
11	9, 10	eqtrdi 2812	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐽 Fn (𝑡 × 𝑡)) → dom dom 𝐽 = 𝑡)
12	6, 11	eqtr2d 2797	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐽 Fn (𝑡 × 𝑡)) → 𝑡 = 𝑇)
13	12	sqxpeqd 5683	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐽 Fn (𝑡 × 𝑡)) → (𝑡 × 𝑡) = (𝑇 × 𝑇))
14	13	fneq2d 6631	. . . . . 6 ⊢ ((𝜑 ∧ 𝐽 Fn (𝑡 × 𝑡)) → (𝐽 Fn (𝑡 × 𝑡) ↔ 𝐽 Fn (𝑇 × 𝑇)))
15	4, 14	mpbid 235	. . . . 5 ⊢ ((𝜑 ∧ 𝐽 Fn (𝑡 × 𝑡)) → 𝐽 Fn (𝑇 × 𝑇))
16	15	ex 418	. . . 4 ⊢ (𝜑 → (𝐽 Fn (𝑡 × 𝑡) → 𝐽 Fn (𝑇 × 𝑇)))
17	16	adantrd 497	. . 3 ⊢ (𝜑 → ((𝐽 Fn (𝑡 × 𝑡) ∧ ∃𝑦 ∈ 𝒫 𝑡𝐻 ∈ X𝑥 ∈ (𝑦 × 𝑦)𝒫 (𝐽‘𝑥)) → 𝐽 Fn (𝑇 × 𝑇)))
18	17	exlimdv 1966	. 2 ⊢ (𝜑 → (∃𝑡(𝐽 Fn (𝑡 × 𝑡) ∧ ∃𝑦 ∈ 𝒫 𝑡𝐻 ∈ X𝑥 ∈ (𝑦 × 𝑦)𝒫 (𝐽‘𝑥)) → 𝐽 Fn (𝑇 × 𝑇)))
19	3, 18	mpd 16	1 ⊢ (𝜑 → 𝐽 Fn (𝑇 × 𝑇))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃wrex 3087  𝒫 cpw 4557   class class class wbr 5103   × cxp 5649  dom cdm 5651   Fn wfn 6532  ‘cfv 6537  Xcixp 8918   ⊆_cat cssc 17975

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ixp 8919  df-ssc 17978

This theorem is used by:  ssc2  17990  ssctr  17993  iinfssc  50134