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

Theorem sradsg 14757
Description: Distance function of a subring algebra. (Contributed by Mario Carneiro, 4-Oct-2015.) (Revised by Thierry Arnoux, 16-Jun-2019.) (Revised by AV, 29-Oct-2024.)
Hypotheses
Ref Expression
srapart.a  |-  ( ph  ->  A  =  ( (subringAlg  `  W ) `  S
) )
srapart.s  |-  ( ph  ->  S  C_  ( Base `  W ) )
srapart.ex  |-  ( ph  ->  W  e.  X )
Assertion
Ref Expression
sradsg  |-  ( ph  ->  ( dist `  W
)  =  ( dist `  A ) )

Proof of Theorem sradsg
StepHypRef Expression
1 srapart.a . 2  |-  ( ph  ->  A  =  ( (subringAlg  `  W ) `  S
) )
2 srapart.s . 2  |-  ( ph  ->  S  C_  ( Base `  W ) )
3 srapart.ex . 2  |-  ( ph  ->  W  e.  X )
4 dsslid 13548 . 2  |-  ( dist 
= Slot  ( dist `  ndx )  /\  ( dist `  ndx )  e.  NN )
5 slotsdnscsi 13554 . . . 4  |-  ( (
dist `  ndx )  =/=  (Scalar `  ndx )  /\  ( dist `  ndx )  =/=  ( .s `  ndx )  /\  ( dist `  ndx )  =/=  ( .i `  ndx ) )
65simp1i 1037 . . 3  |-  ( dist `  ndx )  =/=  (Scalar ` 
ndx )
76necomi 2505 . 2  |-  (Scalar `  ndx )  =/=  ( dist `  ndx )
85simp2i 1038 . . 3  |-  ( dist `  ndx )  =/=  ( .s `  ndx )
98necomi 2505 . 2  |-  ( .s
`  ndx )  =/=  ( dist `  ndx )
105simp3i 1039 . . 3  |-  ( dist `  ndx )  =/=  ( .i `  ndx )
1110necomi 2505 . 2  |-  ( .i
`  ndx )  =/=  ( dist `  ndx )
121, 2, 3, 4, 7, 9, 11sralemg 14747 1  |-  ( ph  ->  ( dist `  W
)  =  ( dist `  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1402    e. wcel 2209    =/= wne 2420    C_ wss 3220   ` cfv 5372   ndxcnx 13327   Basecbs 13330  Scalarcsca 13411   .scvsca 13412   .icip 13413   distcds 13417  subringAlg csra 14742
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-mulrcl 8268  ax-addcom 8269  ax-mulcom 8270  ax-addass 8271  ax-mulass 8272  ax-distr 8273  ax-i2m1 8274  ax-0lt1 8275  ax-1rid 8276  ax-0id 8277  ax-rnegex 8278  ax-precex 8279  ax-cnre 8280  ax-pre-ltirr 8281  ax-pre-ltwlin 8282  ax-pre-lttrn 8283  ax-pre-ltadd 8285  ax-pre-mulgt0 8286
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-riota 6028  df-ov 6078  df-oprab 6079  df-mpo 6080  df-pnf 8352  df-mnf 8353  df-xr 8354  df-ltxr 8355  df-le 8356  df-sub 8489  df-neg 8490  df-inn 9284  df-2 9342  df-3 9343  df-4 9344  df-5 9345  df-6 9346  df-7 9347  df-8 9348  df-9 9349  df-n0 9543  df-z 9624  df-dec 9757  df-ndx 13333  df-slot 13334  df-base 13336  df-sets 13337  df-iress 13338  df-mulr 13422  df-sca 13424  df-vsca 13425  df-ip 13426  df-ds 13430  df-sra 14744
This theorem is referenced by:  rlmdsg  14772
  Copyright terms: Public domain W3C validator