ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  subsubrng GIF version

Theorem subsubrng 14221
Description: A subring of a subring is a subring. (Contributed by AV, 15-Feb-2025.)
Hypothesis
Ref Expression
subsubrng.s 𝑆 = (𝑅s 𝐴)
Assertion
Ref Expression
subsubrng (𝐴 ∈ (SubRng‘𝑅) → (𝐵 ∈ (SubRng‘𝑆) ↔ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)))

Proof of Theorem subsubrng
StepHypRef Expression
1 subrngrcl 14210 . . . . 5 (𝐴 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng)
21adantr 276 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝑅 ∈ Rng)
3 eqid 2229 . . . . . . . . 9 (Base‘𝑆) = (Base‘𝑆)
43subrngss 14207 . . . . . . . 8 (𝐵 ∈ (SubRng‘𝑆) → 𝐵 ⊆ (Base‘𝑆))
54adantl 277 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ⊆ (Base‘𝑆))
6 subsubrng.s . . . . . . . . 9 𝑆 = (𝑅s 𝐴)
76subrngbas 14213 . . . . . . . 8 (𝐴 ∈ (SubRng‘𝑅) → 𝐴 = (Base‘𝑆))
87adantr 276 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐴 = (Base‘𝑆))
95, 8sseqtrrd 3264 . . . . . 6 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵𝐴)
106oveq1i 6023 . . . . . . 7 (𝑆s 𝐵) = ((𝑅s 𝐴) ↾s 𝐵)
11 ressabsg 13152 . . . . . . . . 9 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴𝑅 ∈ Rng) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
12113expa 1227 . . . . . . . 8 (((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) ∧ 𝑅 ∈ Rng) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
131, 12mpidan 423 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
1410, 13eqtrid 2274 . . . . . 6 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) → (𝑆s 𝐵) = (𝑅s 𝐵))
159, 14syldan 282 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑆s 𝐵) = (𝑅s 𝐵))
16 eqid 2229 . . . . . . 7 (𝑆s 𝐵) = (𝑆s 𝐵)
1716subrngrng 14209 . . . . . 6 (𝐵 ∈ (SubRng‘𝑆) → (𝑆s 𝐵) ∈ Rng)
1817adantl 277 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑆s 𝐵) ∈ Rng)
1915, 18eqeltrrd 2307 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑅s 𝐵) ∈ Rng)
20 eqid 2229 . . . . . . 7 (Base‘𝑅) = (Base‘𝑅)
2120subrngss 14207 . . . . . 6 (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
2221adantr 276 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐴 ⊆ (Base‘𝑅))
239, 22sstrd 3235 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ⊆ (Base‘𝑅))
2420issubrng 14206 . . . 4 (𝐵 ∈ (SubRng‘𝑅) ↔ (𝑅 ∈ Rng ∧ (𝑅s 𝐵) ∈ Rng ∧ 𝐵 ⊆ (Base‘𝑅)))
252, 19, 23, 24syl3anbrc 1205 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ∈ (SubRng‘𝑅))
2625, 9jca 306 . 2 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴))
276subrngrng 14209 . . . 4 (𝐴 ∈ (SubRng‘𝑅) → 𝑆 ∈ Rng)
2827adantr 276 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝑆 ∈ Rng)
2914adantrl 478 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑆s 𝐵) = (𝑅s 𝐵))
30 eqid 2229 . . . . . 6 (𝑅s 𝐵) = (𝑅s 𝐵)
3130subrngrng 14209 . . . . 5 (𝐵 ∈ (SubRng‘𝑅) → (𝑅s 𝐵) ∈ Rng)
3231ad2antrl 490 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑅s 𝐵) ∈ Rng)
3329, 32eqeltrd 2306 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑆s 𝐵) ∈ Rng)
34 simprr 531 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐵𝐴)
357adantr 276 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐴 = (Base‘𝑆))
3634, 35sseqtrd 3263 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐵 ⊆ (Base‘𝑆))
373issubrng 14206 . . 3 (𝐵 ∈ (SubRng‘𝑆) ↔ (𝑆 ∈ Rng ∧ (𝑆s 𝐵) ∈ Rng ∧ 𝐵 ⊆ (Base‘𝑆)))
3828, 33, 36, 37syl3anbrc 1205 . 2 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐵 ∈ (SubRng‘𝑆))
3926, 38impbida 598 1 (𝐴 ∈ (SubRng‘𝑅) → (𝐵 ∈ (SubRng‘𝑆) ↔ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1395  wcel 2200  wss 3198  cfv 5324  (class class class)co 6013  Basecbs 13075  s cress 13076  Rngcrng 13938  SubRngcsubrng 14204
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8116  ax-resscn 8117  ax-1re 8119  ax-addrcl 8122
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-fv 5332  df-ov 6016  df-oprab 6017  df-mpo 6018  df-inn 9137  df-2 9195  df-3 9196  df-ndx 13078  df-slot 13079  df-base 13081  df-sets 13082  df-iress 13083  df-plusg 13166  df-mulr 13167  df-subg 13750  df-abl 13867  df-rng 13939  df-subrng 14205
This theorem is referenced by:  subsubrng2  14222
  Copyright terms: Public domain W3C validator