Metamath Proof Explorer


Theorem azval

Description: An adjunction of a complex number to the ring of integers. (Contributed by AV, 30-Oct-2026)

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

Proof

Step Hyp Ref Expression
1 sneq ⊢ s = S → s = S
2 1 uneq2d ⊢ s = S → ℤ ∪ s = ℤ ∪ S
3 2 fveq2d ⊢ s = S → RingSpan ⁡ ℂ fld ⁡ ℤ ∪ s = RingSpan ⁡ ℂ fld ⁡ ℤ ∪ S
4 df-az Could not format Z[] = ( s e. CC |-> ( ( RingSpan ` CCfld ) ` ( ZZ u. { s } ) ) ) : No typesetting found for |- Z[] = ( s e. CC |-> ( ( RingSpan ` CCfld ) ` ( ZZ u. { s } ) ) ) with typecode |-
5 fvex ⊢ RingSpan ⁡ ℂ fld ⁡ ℤ ∪ S ∈ V
6 3 4 5 fvmpt 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 |-