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

Theorem subsubrng 14348
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 14337 . . . . 5 (𝐴 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng)
21adantr 276 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝑅 ∈ Rng)
3 eqid 2232 . . . . . . . . 9 (Base‘𝑆) = (Base‘𝑆)
43subrngss 14334 . . . . . . . 8 (𝐵 ∈ (SubRng‘𝑆) → 𝐵 ⊆ (Base‘𝑆))
54adantl 277 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ⊆ (Base‘𝑆))
6 subsubrng.s . . . . . . . . 9 𝑆 = (𝑅s 𝐴)
76subrngbas 14340 . . . . . . . 8 (𝐴 ∈ (SubRng‘𝑅) → 𝐴 = (Base‘𝑆))
87adantr 276 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐴 = (Base‘𝑆))
95, 8sseqtrrd 3276 . . . . . 6 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵𝐴)
106oveq1i 6059 . . . . . . 7 (𝑆s 𝐵) = ((𝑅s 𝐴) ↾s 𝐵)
11 ressabsg 13278 . . . . . . . . 9 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴𝑅 ∈ Rng) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
12113expa 1230 . . . . . . . 8 (((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) ∧ 𝑅 ∈ Rng) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
131, 12mpidan 423 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
1410, 13eqtrid 2277 . . . . . 6 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) → (𝑆s 𝐵) = (𝑅s 𝐵))
159, 14syldan 282 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑆s 𝐵) = (𝑅s 𝐵))
16 eqid 2232 . . . . . . 7 (𝑆s 𝐵) = (𝑆s 𝐵)
1716subrngrng 14336 . . . . . 6 (𝐵 ∈ (SubRng‘𝑆) → (𝑆s 𝐵) ∈ Rng)
1817adantl 277 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑆s 𝐵) ∈ Rng)
1915, 18eqeltrrd 2310 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑅s 𝐵) ∈ Rng)
20 eqid 2232 . . . . . . 7 (Base‘𝑅) = (Base‘𝑅)
2120subrngss 14334 . . . . . 6 (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
2221adantr 276 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐴 ⊆ (Base‘𝑅))
239, 22sstrd 3247 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ⊆ (Base‘𝑅))
2420issubrng 14333 . . . 4 (𝐵 ∈ (SubRng‘𝑅) ↔ (𝑅 ∈ Rng ∧ (𝑅s 𝐵) ∈ Rng ∧ 𝐵 ⊆ (Base‘𝑅)))
252, 19, 23, 24syl3anbrc 1208 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ∈ (SubRng‘𝑅))
2625, 9jca 306 . 2 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴))
276subrngrng 14336 . . . 4 (𝐴 ∈ (SubRng‘𝑅) → 𝑆 ∈ Rng)
2827adantr 276 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝑆 ∈ Rng)
2914adantrl 478 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑆s 𝐵) = (𝑅s 𝐵))
30 eqid 2232 . . . . . 6 (𝑅s 𝐵) = (𝑅s 𝐵)
3130subrngrng 14336 . . . . 5 (𝐵 ∈ (SubRng‘𝑅) → (𝑅s 𝐵) ∈ Rng)
3231ad2antrl 490 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑅s 𝐵) ∈ Rng)
3329, 32eqeltrd 2309 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑆s 𝐵) ∈ Rng)
34 simprr 533 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐵𝐴)
357adantr 276 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐴 = (Base‘𝑆))
3634, 35sseqtrd 3275 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐵 ⊆ (Base‘𝑆))
373issubrng 14333 . . 3 (𝐵 ∈ (SubRng‘𝑆) ↔ (𝑆 ∈ Rng ∧ (𝑆s 𝐵) ∈ Rng ∧ 𝐵 ⊆ (Base‘𝑆)))
3828, 33, 36, 37syl3anbrc 1208 . 2 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐵 ∈ (SubRng‘𝑆))
3926, 38impbida 600 1 (𝐴 ∈ (SubRng‘𝑅) → (𝐵 ∈ (SubRng‘𝑆) ↔ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1398  wcel 2203  wss 3210  cfv 5351  (class class class)co 6049  Basecbs 13201  s cress 13202  Rngcrng 14065  SubRngcsubrng 14331
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8214  ax-resscn 8215  ax-1re 8217  ax-addrcl 8220
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-inn 9234  df-2 9292  df-3 9293  df-ndx 13204  df-slot 13205  df-base 13207  df-sets 13208  df-iress 13209  df-plusg 13292  df-mulr 13293  df-subg 13876  df-abl 13993  df-rng 14066  df-subrng 14332
This theorem is referenced by:  subsubrng2  14349
  Copyright terms: Public domain W3C validator