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

Theorem subsubrng 14143
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 14132 . . . . 5 (𝐴 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng)
21adantr 276 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝑅 ∈ Rng)
3 eqid 2209 . . . . . . . . 9 (Base‘𝑆) = (Base‘𝑆)
43subrngss 14129 . . . . . . . 8 (𝐵 ∈ (SubRng‘𝑆) → 𝐵 ⊆ (Base‘𝑆))
54adantl 277 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ⊆ (Base‘𝑆))
6 subsubrng.s . . . . . . . . 9 𝑆 = (𝑅s 𝐴)
76subrngbas 14135 . . . . . . . 8 (𝐴 ∈ (SubRng‘𝑅) → 𝐴 = (Base‘𝑆))
87adantr 276 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐴 = (Base‘𝑆))
95, 8sseqtrrd 3243 . . . . . 6 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵𝐴)
106oveq1i 5984 . . . . . . 7 (𝑆s 𝐵) = ((𝑅s 𝐴) ↾s 𝐵)
11 ressabsg 13075 . . . . . . . . 9 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴𝑅 ∈ Rng) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
12113expa 1208 . . . . . . . 8 (((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) ∧ 𝑅 ∈ Rng) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
131, 12mpidan 423 . . . . . . 7 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) → ((𝑅s 𝐴) ↾s 𝐵) = (𝑅s 𝐵))
1410, 13eqtrid 2254 . . . . . 6 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴) → (𝑆s 𝐵) = (𝑅s 𝐵))
159, 14syldan 282 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑆s 𝐵) = (𝑅s 𝐵))
16 eqid 2209 . . . . . . 7 (𝑆s 𝐵) = (𝑆s 𝐵)
1716subrngrng 14131 . . . . . 6 (𝐵 ∈ (SubRng‘𝑆) → (𝑆s 𝐵) ∈ Rng)
1817adantl 277 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑆s 𝐵) ∈ Rng)
1915, 18eqeltrrd 2287 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝑅s 𝐵) ∈ Rng)
20 eqid 2209 . . . . . . 7 (Base‘𝑅) = (Base‘𝑅)
2120subrngss 14129 . . . . . 6 (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
2221adantr 276 . . . . 5 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐴 ⊆ (Base‘𝑅))
239, 22sstrd 3214 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ⊆ (Base‘𝑅))
2420issubrng 14128 . . . 4 (𝐵 ∈ (SubRng‘𝑅) ↔ (𝑅 ∈ Rng ∧ (𝑅s 𝐵) ∈ Rng ∧ 𝐵 ⊆ (Base‘𝑅)))
252, 19, 23, 24syl3anbrc 1186 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → 𝐵 ∈ (SubRng‘𝑅))
2625, 9jca 306 . 2 ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝐵 ∈ (SubRng‘𝑆)) → (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴))
276subrngrng 14131 . . . 4 (𝐴 ∈ (SubRng‘𝑅) → 𝑆 ∈ Rng)
2827adantr 276 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝑆 ∈ Rng)
2914adantrl 478 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑆s 𝐵) = (𝑅s 𝐵))
30 eqid 2209 . . . . . 6 (𝑅s 𝐵) = (𝑅s 𝐵)
3130subrngrng 14131 . . . . 5 (𝐵 ∈ (SubRng‘𝑅) → (𝑅s 𝐵) ∈ Rng)
3231ad2antrl 490 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑅s 𝐵) ∈ Rng)
3329, 32eqeltrd 2286 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → (𝑆s 𝐵) ∈ Rng)
34 simprr 531 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐵𝐴)
357adantr 276 . . . 4 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐴 = (Base‘𝑆))
3634, 35sseqtrd 3242 . . 3 ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝐵 ∈ (SubRng‘𝑅) ∧ 𝐵𝐴)) → 𝐵 ⊆ (Base‘𝑆))
373issubrng 14128 . . 3 (𝐵 ∈ (SubRng‘𝑆) ↔ (𝑆 ∈ Rng ∧ (𝑆s 𝐵) ∈ Rng ∧ 𝐵 ⊆ (Base‘𝑆)))
3828, 33, 36, 37syl3anbrc 1186 . 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 1375  wcel 2180  wss 3177  cfv 5294  (class class class)co 5974  Basecbs 12998  s cress 12999  Rngcrng 13861  SubRngcsubrng 14126
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 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-13 2182  ax-14 2183  ax-ext 2191  ax-sep 4181  ax-pow 4237  ax-pr 4272  ax-un 4501  ax-setind 4606  ax-cnex 8058  ax-resscn 8059  ax-1re 8061  ax-addrcl 8064
This theorem depends on definitions:  df-bi 117  df-3an 985  df-tru 1378  df-fal 1381  df-nf 1487  df-sb 1789  df-eu 2060  df-mo 2061  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ne 2381  df-ral 2493  df-rex 2494  df-rab 2497  df-v 2781  df-sbc 3009  df-csb 3105  df-dif 3179  df-un 3181  df-in 3183  df-ss 3190  df-nul 3472  df-pw 3631  df-sn 3652  df-pr 3653  df-op 3655  df-uni 3868  df-int 3903  df-br 4063  df-opab 4125  df-mpt 4126  df-id 4361  df-xp 4702  df-rel 4703  df-cnv 4704  df-co 4705  df-dm 4706  df-rn 4707  df-res 4708  df-ima 4709  df-iota 5254  df-fun 5296  df-fn 5297  df-fv 5302  df-ov 5977  df-oprab 5978  df-mpo 5979  df-inn 9079  df-2 9137  df-3 9138  df-ndx 13001  df-slot 13002  df-base 13004  df-sets 13005  df-iress 13006  df-plusg 13089  df-mulr 13090  df-subg 13673  df-abl 13790  df-rng 13862  df-subrng 14127
This theorem is referenced by:  subsubrng2  14144
  Copyright terms: Public domain W3C validator