Metamath Proof Explorer


Theorem azssid

Description: The union of the integers and the adjoined complex number are a subset of the adjunction. (Contributed by AV, 31-Oct-2026)

Ref Expression
Assertion azssid Could not format assertion : No typesetting found for |- ( S e. CC -> ( ZZ u. { S } ) C_ ( Z[] ` S ) ) with typecode |-

Proof

Step Hyp Ref Expression
1 cnring ⊢ ℂ fld ∈ Ring
2 1 a1i ⊢ S ∈ ℂ → ℂ fld ∈ Ring
3 cnfldbas ⊢ ℂ = Base ℂ fld
4 3 a1i ⊢ S ∈ ℂ → ℂ = Base ℂ fld
5 zsscn ⊢ ℤ ⊆ ℂ
6 5 a1i ⊢ S ∈ ℂ → ℤ ⊆ ℂ
7 snssi ⊢ S ∈ ℂ → S ⊆ ℂ
8 6 7 unssd ⊢ S ∈ ℂ → ℤ ∪ S ⊆ ℂ
9 eqidd ⊢ S ∈ ℂ → RingSpan ⁡ ℂ fld = RingSpan ⁡ ℂ fld
10 azval Could not format ( S e. CC -> ( Z[] ` S ) = ( ( RingSpan ` CCfld ) ` ( ZZ u. { S } ) ) ) : No typesetting found for |- ( S e. CC -> ( Z[] ` S ) = ( ( RingSpan ` CCfld ) ` ( ZZ u. { S } ) ) ) with typecode |-
11 2 4 8 9 10 rgspnssid Could not format ( S e. CC -> ( ZZ u. { S } ) C_ ( Z[] ` S ) ) : No typesetting found for |- ( S e. CC -> ( ZZ u. { S } ) C_ ( Z[] ` S ) ) with typecode |-