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

Theorem rnghmsscmap 20595
Description: The non-unital ring homomorphisms between non-unital rings (in a universe) are a subcategory subset of the mappings between base sets of extensible structures (in the same universe). (Contributed by AV, 9-Mar-2020.)
Hypotheses
Ref Expression
rnghmsscmap.u (𝜑𝑈𝑉)
rnghmsscmap.r (𝜑𝑅 = (Rng ∩ 𝑈))
Assertion
Ref Expression
rnghmsscmap (𝜑 → ( RngHom ↾ (𝑅 × 𝑅)) ⊆cat (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
Distinct variable groups:   𝑥,𝑅,𝑦   𝑥,𝑈,𝑦   𝜑,𝑥,𝑦
Allowed substitution hints:   𝑉(𝑥,𝑦)

Proof of Theorem rnghmsscmap
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rnghmsscmap.r . . 3 (𝜑𝑅 = (Rng ∩ 𝑈))
2 inss2 4218 . . 3 (Rng ∩ 𝑈) ⊆ 𝑈
31, 2eqsstrdi 4008 . 2 (𝜑𝑅𝑈)
4 eqid 2736 . . . . . . 7 (Base‘𝑎) = (Base‘𝑎)
5 eqid 2736 . . . . . . 7 (Base‘𝑏) = (Base‘𝑏)
64, 5rnghmf 20413 . . . . . 6 ( ∈ (𝑎 RngHom 𝑏) → :(Base‘𝑎)⟶(Base‘𝑏))
7 simpr 484 . . . . . . . 8 (((𝜑 ∧ (𝑎𝑅𝑏𝑅)) ∧ :(Base‘𝑎)⟶(Base‘𝑏)) → :(Base‘𝑎)⟶(Base‘𝑏))
8 fvex 6894 . . . . . . . . . 10 (Base‘𝑏) ∈ V
9 fvex 6894 . . . . . . . . . 10 (Base‘𝑎) ∈ V
108, 9pm3.2i 470 . . . . . . . . 9 ((Base‘𝑏) ∈ V ∧ (Base‘𝑎) ∈ V)
11 elmapg 8858 . . . . . . . . 9 (((Base‘𝑏) ∈ V ∧ (Base‘𝑎) ∈ V) → ( ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) ↔ :(Base‘𝑎)⟶(Base‘𝑏)))
1210, 11mp1i 13 . . . . . . . 8 (((𝜑 ∧ (𝑎𝑅𝑏𝑅)) ∧ :(Base‘𝑎)⟶(Base‘𝑏)) → ( ∈ ((Base‘𝑏) ↑m (Base‘𝑎)) ↔ :(Base‘𝑎)⟶(Base‘𝑏)))
137, 12mpbird 257 . . . . . . 7 (((𝜑 ∧ (𝑎𝑅𝑏𝑅)) ∧ :(Base‘𝑎)⟶(Base‘𝑏)) → ∈ ((Base‘𝑏) ↑m (Base‘𝑎)))
1413ex 412 . . . . . 6 ((𝜑 ∧ (𝑎𝑅𝑏𝑅)) → (:(Base‘𝑎)⟶(Base‘𝑏) → ∈ ((Base‘𝑏) ↑m (Base‘𝑎))))
156, 14syl5 34 . . . . 5 ((𝜑 ∧ (𝑎𝑅𝑏𝑅)) → ( ∈ (𝑎 RngHom 𝑏) → ∈ ((Base‘𝑏) ↑m (Base‘𝑎))))
1615ssrdv 3969 . . . 4 ((𝜑 ∧ (𝑎𝑅𝑏𝑅)) → (𝑎 RngHom 𝑏) ⊆ ((Base‘𝑏) ↑m (Base‘𝑎)))
17 ovres 7578 . . . . 5 ((𝑎𝑅𝑏𝑅) → (𝑎( RngHom ↾ (𝑅 × 𝑅))𝑏) = (𝑎 RngHom 𝑏))
1817adantl 481 . . . 4 ((𝜑 ∧ (𝑎𝑅𝑏𝑅)) → (𝑎( RngHom ↾ (𝑅 × 𝑅))𝑏) = (𝑎 RngHom 𝑏))
19 eqidd 2737 . . . . 5 ((𝜑 ∧ (𝑎𝑅𝑏𝑅)) → (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) = (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
20 fveq2 6881 . . . . . . 7 (𝑦 = 𝑏 → (Base‘𝑦) = (Base‘𝑏))
21 fveq2 6881 . . . . . . 7 (𝑥 = 𝑎 → (Base‘𝑥) = (Base‘𝑎))
2220, 21oveqan12rd 7430 . . . . . 6 ((𝑥 = 𝑎𝑦 = 𝑏) → ((Base‘𝑦) ↑m (Base‘𝑥)) = ((Base‘𝑏) ↑m (Base‘𝑎)))
2322adantl 481 . . . . 5 (((𝜑 ∧ (𝑎𝑅𝑏𝑅)) ∧ (𝑥 = 𝑎𝑦 = 𝑏)) → ((Base‘𝑦) ↑m (Base‘𝑥)) = ((Base‘𝑏) ↑m (Base‘𝑎)))
243sseld 3962 . . . . . . . 8 (𝜑 → (𝑎𝑅𝑎𝑈))
2524com12 32 . . . . . . 7 (𝑎𝑅 → (𝜑𝑎𝑈))
2625adantr 480 . . . . . 6 ((𝑎𝑅𝑏𝑅) → (𝜑𝑎𝑈))
2726impcom 407 . . . . 5 ((𝜑 ∧ (𝑎𝑅𝑏𝑅)) → 𝑎𝑈)
283sseld 3962 . . . . . . . 8 (𝜑 → (𝑏𝑅𝑏𝑈))
2928com12 32 . . . . . . 7 (𝑏𝑅 → (𝜑𝑏𝑈))
3029adantl 481 . . . . . 6 ((𝑎𝑅𝑏𝑅) → (𝜑𝑏𝑈))
3130impcom 407 . . . . 5 ((𝜑 ∧ (𝑎𝑅𝑏𝑅)) → 𝑏𝑈)
32 ovexd 7445 . . . . 5 ((𝜑 ∧ (𝑎𝑅𝑏𝑅)) → ((Base‘𝑏) ↑m (Base‘𝑎)) ∈ V)
3319, 23, 27, 31, 32ovmpod 7564 . . . 4 ((𝜑 ∧ (𝑎𝑅𝑏𝑅)) → (𝑎(𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))𝑏) = ((Base‘𝑏) ↑m (Base‘𝑎)))
3416, 18, 333sstr4d 4019 . . 3 ((𝜑 ∧ (𝑎𝑅𝑏𝑅)) → (𝑎( RngHom ↾ (𝑅 × 𝑅))𝑏) ⊆ (𝑎(𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))𝑏))
3534ralrimivva 3188 . 2 (𝜑 → ∀𝑎𝑅𝑏𝑅 (𝑎( RngHom ↾ (𝑅 × 𝑅))𝑏) ⊆ (𝑎(𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))𝑏))
36 rnghmfn 20404 . . . . 5 RngHom Fn (Rng × Rng)
3736a1i 11 . . . 4 (𝜑 → RngHom Fn (Rng × Rng))
38 inss1 4217 . . . . . 6 (Rng ∩ 𝑈) ⊆ Rng
391, 38eqsstrdi 4008 . . . . 5 (𝜑𝑅 ⊆ Rng)
40 xpss12 5674 . . . . 5 ((𝑅 ⊆ Rng ∧ 𝑅 ⊆ Rng) → (𝑅 × 𝑅) ⊆ (Rng × Rng))
4139, 39, 40syl2anc 584 . . . 4 (𝜑 → (𝑅 × 𝑅) ⊆ (Rng × Rng))
42 fnssres 6666 . . . 4 (( RngHom Fn (Rng × Rng) ∧ (𝑅 × 𝑅) ⊆ (Rng × Rng)) → ( RngHom ↾ (𝑅 × 𝑅)) Fn (𝑅 × 𝑅))
4337, 41, 42syl2anc 584 . . 3 (𝜑 → ( RngHom ↾ (𝑅 × 𝑅)) Fn (𝑅 × 𝑅))
44 eqid 2736 . . . . 5 (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) = (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))
45 ovex 7443 . . . . 5 ((Base‘𝑦) ↑m (Base‘𝑥)) ∈ V
4644, 45fnmpoi 8074 . . . 4 (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) Fn (𝑈 × 𝑈)
4746a1i 11 . . 3 (𝜑 → (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) Fn (𝑈 × 𝑈))
48 rnghmsscmap.u . . . 4 (𝜑𝑈𝑉)
49 elex 3485 . . . 4 (𝑈𝑉𝑈 ∈ V)
5048, 49syl 17 . . 3 (𝜑𝑈 ∈ V)
5143, 47, 50isssc 17838 . 2 (𝜑 → (( RngHom ↾ (𝑅 × 𝑅)) ⊆cat (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))) ↔ (𝑅𝑈 ∧ ∀𝑎𝑅𝑏𝑅 (𝑎( RngHom ↾ (𝑅 × 𝑅))𝑏) ⊆ (𝑎(𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥)))𝑏))))
523, 35, 51mpbir2and 713 1 (𝜑 → ( RngHom ↾ (𝑅 × 𝑅)) ⊆cat (𝑥𝑈, 𝑦𝑈 ↦ ((Base‘𝑦) ↑m (Base‘𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wral 3052  Vcvv 3464  cin 3930  wss 3931   class class class wbr 5124   × cxp 5657  cres 5661   Fn wfn 6531  wf 6532  cfv 6536  (class class class)co 7410  cmpo 7412  m cmap 8845  Basecbs 17233  cat cssc 17825  Rngcrng 20117   RngHom crnghm 20399
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 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pow 5340  ax-pr 5407  ax-un 7734
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 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7993  df-2nd 7994  df-map 8847  df-ixp 8917  df-ssc 17828  df-ghm 19201  df-abl 19769  df-rng 20118  df-rnghm 20401
This theorem is referenced by:  rnghmsubcsetc  20598
  Copyright terms: Public domain W3C validator