MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ssc2 Structured version   Visualization version   GIF version

Theorem ssc2 17914
Description: Infer subset relation on morphisms from the subcategory subset relation. (Contributed by Mario Carneiro, 6-Jan-2017.)
Hypotheses
Ref Expression
ssc2.1 (𝜑𝐻 Fn (𝑆 × 𝑆))
ssc2.2 (𝜑𝐻cat 𝐽)
ssc2.3 (𝜑𝑋𝑆)
ssc2.4 (𝜑𝑌𝑆)
Assertion
Ref Expression
ssc2 (𝜑 → (𝑋𝐻𝑌) ⊆ (𝑋𝐽𝑌))

Proof of Theorem ssc2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssc2.3 . 2 (𝜑𝑋𝑆)
2 ssc2.4 . 2 (𝜑𝑌𝑆)
3 ssc2.2 . . . 4 (𝜑𝐻cat 𝐽)
4 ssc2.1 . . . . 5 (𝜑𝐻 Fn (𝑆 × 𝑆))
5 eqidd 2761 . . . . . 6 (𝜑 → dom dom 𝐽 = dom dom 𝐽)
63, 5sscfn2 17910 . . . . 5 (𝜑𝐽 Fn (dom dom 𝐽 × dom dom 𝐽))
7 sscrel 17905 . . . . . . 7 Rel ⊆cat
87brrelex2i 5712 . . . . . 6 (𝐻cat 𝐽𝐽 ∈ V)
9 dmexg 7899 . . . . . 6 (𝐽 ∈ V → dom 𝐽 ∈ V)
10 dmexg 7899 . . . . . 6 (dom 𝐽 ∈ V → dom dom 𝐽 ∈ V)
113, 8, 9, 104syl 20 . . . . 5 (𝜑 → dom dom 𝐽 ∈ V)
124, 6, 11isssc 17912 . . . 4 (𝜑 → (𝐻cat 𝐽 ↔ (𝑆 ⊆ dom dom 𝐽 ∧ ∀𝑥𝑆𝑦𝑆 (𝑥𝐻𝑦) ⊆ (𝑥𝐽𝑦))))
133, 12mpbid 235 . . 3 (𝜑 → (𝑆 ⊆ dom dom 𝐽 ∧ ∀𝑥𝑆𝑦𝑆 (𝑥𝐻𝑦) ⊆ (𝑥𝐽𝑦)))
1413simprd 501 . 2 (𝜑 → ∀𝑥𝑆𝑦𝑆 (𝑥𝐻𝑦) ⊆ (𝑥𝐽𝑦))
15 oveq1 7421 . . . 4 (𝑥 = 𝑋 → (𝑥𝐻𝑦) = (𝑋𝐻𝑦))
16 oveq1 7421 . . . 4 (𝑥 = 𝑋 → (𝑥𝐽𝑦) = (𝑋𝐽𝑦))
1715, 16sseq12d 3964 . . 3 (𝑥 = 𝑋 → ((𝑥𝐻𝑦) ⊆ (𝑥𝐽𝑦) ↔ (𝑋𝐻𝑦) ⊆ (𝑋𝐽𝑦)))
18 oveq2 7422 . . . 4 (𝑦 = 𝑌 → (𝑋𝐻𝑦) = (𝑋𝐻𝑌))
19 oveq2 7422 . . . 4 (𝑦 = 𝑌 → (𝑋𝐽𝑦) = (𝑋𝐽𝑌))
2018, 19sseq12d 3964 . . 3 (𝑦 = 𝑌 → ((𝑋𝐻𝑦) ⊆ (𝑋𝐽𝑦) ↔ (𝑋𝐻𝑌) ⊆ (𝑋𝐽𝑌)))
2117, 20rspc2va 3588 . 2 (((𝑋𝑆𝑌𝑆) ∧ ∀𝑥𝑆𝑦𝑆 (𝑥𝐻𝑦) ⊆ (𝑥𝐽𝑦)) → (𝑋𝐻𝑌) ⊆ (𝑋𝐽𝑌))
221, 2, 14, 21syl21anc 851 1 (𝜑 → (𝑋𝐻𝑌) ⊆ (𝑋𝐽𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wral 3076  Vcvv 3450  wss 3899   class class class wbr 5103   × cxp 5653  dom cdm 5655   Fn wfn 6528  (class class class)co 7414  cat cssc 17899
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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737
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 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-reu 3366  df-rab 3413  df-v 3452  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 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-ixp 8908  df-ssc 17902
This theorem is used by:  ssctr  17917  ssceq  17918  subcss2  17935  iinfssc  49986  ssccatid  50001
  Copyright terms: Public domain W3C validator