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

Theorem subsubrng 13586
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 13575 . . . . 5 (𝐴 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng)
21adantr 276 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝑅 ∈ Rng)
3 eqid 2189 . . . . . . . . 9 (Base‘𝑆) = (Base‘𝑆)
43subrngss 13572 . . . . . . . 8 (𝐵 ∈ (SubRng‘𝑆) → 𝐵 ⊆ (Base‘𝑆))
54adantl 277 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ⊆ (Base‘𝑆))
6 subsubrng.s . . . . . . . . 9 𝑆 = (𝑅s 𝐴)
76subrngbas 13578 . . . . . . . 8 (𝐴 ∈ (SubRng‘𝑅) → 𝐴 = (Base‘𝑆))
87adantr 276 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐴 = (Base‘𝑆))
95, 8sseqtrrd 3209 . . . . . 6 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵𝐴)
106oveq1i 5910 . . . . . . 7 (𝑆s 𝐵) = ((𝑅s 𝐴) ↾s 𝐵)
11 ressabsg 12599 . . . . . . . . 9 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴𝑅 ∈ Rng) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
12113expa 1205 . . . . . . . 8 (((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) ∧ 𝑅 ∈ Rng) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
131, 12mpidan 423 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
1410, 13eqtrid 2234 . . . . . 6 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) → (𝑆s 𝐵) = (𝑅s 𝐵))
159, 14syldan 282 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑆s 𝐵) = (𝑅s 𝐵))
16 eqid 2189 . . . . . . 7 (𝑆s 𝐵) = (𝑆s 𝐵)
1716subrngrng 13574 . . . . . 6 (𝐵 ∈ (SubRng‘𝑆) → (𝑆s 𝐵) ∈ Rng)
1817adantl 277 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑆s 𝐵) ∈ Rng)
1915, 18eqeltrrd 2267 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑅s 𝐵) ∈ Rng)
20 eqid 2189 . . . . . . 7 (Base‘𝑅) = (Base‘𝑅)
2120subrngss 13572 . . . . . 6 (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
2221adantr 276 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐴 ⊆ (Base‘𝑅))
239, 22sstrd 3180 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ⊆ (Base‘𝑅))
2420issubrng 13571 . . . 4 (𝐵 ∈ (SubRng‘𝑅) ↔ (𝑅 ∈ Rng ∧ (𝑅s 𝐵) ∈ Rng ∧ 𝐵 ⊆ (Base‘𝑅)))
252, 19, 23, 24syl3anbrc 1183 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ∈ (SubRng‘𝑅))
2625, 9jca 306 . 2 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴))
276subrngrng 13574 . . . 4 (𝐴 ∈ (SubRng‘𝑅) → 𝑆 ∈ Rng)
2827adantr 276 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝑆 ∈ Rng)
2914adantrl 478 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑆s 𝐵) = (𝑅s 𝐵))
30 eqid 2189 . . . . . 6 (𝑅s 𝐵) = (𝑅s 𝐵)
3130subrngrng 13574 . . . . 5 (𝐵 ∈ (SubRng‘𝑅) → (𝑅s 𝐵) ∈ Rng)
3231ad2antrl 490 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑅s 𝐵) ∈ Rng)
3329, 32eqeltrd 2266 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑆s 𝐵) ∈ Rng)
34 simprr 531 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐵𝐴)
357adantr 276 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐴 = (Base‘𝑆))
3634, 35sseqtrd 3208 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐵 ⊆ (Base‘𝑆))
373issubrng 13571 . . 3 (𝐵 ∈ (SubRng‘𝑆) ↔ (𝑆 ∈ Rng ∧ (𝑆s 𝐵) ∈ Rng ∧ 𝐵 ⊆ (Base‘𝑆)))
3828, 33, 36, 37syl3anbrc 1183 . 2 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐵 ∈ (SubRng‘𝑆))
3926, 38impbida 596 1 (𝐴 ∈ (SubRng‘𝑅) → (𝐵 ∈ (SubRng‘𝑆) ↔ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1364  wcel 2160  wss 3144  cfv 5238  (class class class)co 5900  Basecbs 12523  s cress 12524  Rngcrng 13311  SubRngcsubrng 13569
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-sep 4139  ax-pow 4195  ax-pr 4230  ax-un 4454  ax-setind 4557  ax-cnex 7937  ax-resscn 7938  ax-1re 7940  ax-addrcl 7943
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-ral 2473  df-rex 2474  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3595  df-sn 3616  df-pr 3617  df-op 3619  df-uni 3828  df-int 3863  df-br 4022  df-opab 4083  df-mpt 4084  df-id 4314  df-xp 4653  df-rel 4654  df-cnv 4655  df-co 4656  df-dm 4657  df-rn 4658  df-res 4659  df-ima 4660  df-iota 5199  df-fun 5240  df-fn 5241  df-fv 5246  df-ov 5903  df-oprab 5904  df-mpo 5905  df-inn 8955  df-2 9013  df-3 9014  df-ndx 12526  df-slot 12527  df-base 12529  df-sets 12530  df-iress 12531  df-plusg 12613  df-mulr 12614  df-subg 13134  df-abl 13251  df-rng 13312  df-subrng 13570
This theorem is referenced by:  subsubrng2  13587
  Copyright terms: Public domain W3C validator