code: def test_PrimeIdeal_add():
      T = Poly(cyclotomic_poly(7))
      P0 = prime_decomp(7, T)[0]
      # Adding ideals computes their GCD, so adding the ramified prime dividing
      # 7 to 7 itself should reproduce this prime (as a submodule).
      assert P0 + 7 * P0.ZK == P0.as_submodule()
  
imports: from math import prod
  from sympy import QQ, ZZ
  from sympy.abc import x, theta
  from sympy.ntheory import factorint
  from sympy.ntheory.residue_ntheory import n_order
  from sympy.polys import Poly, cyclotomic_poly
  from sympy.polys.matrices import DomainMatrix
  from sympy.polys.numberfields.basis import round_two
  from sympy.polys.numberfields.exceptions import StructureError
  from sympy.polys.numberfields.modules import PowerBasis, to_col
  from sympy.polys.numberfields.primes import prime_decomp, _two_elt_rep, _check_formal_conditions_for_maximal_order
  from sympy.testing.pytest import raises
label_desc: Use image node_id 13 for calling a global function with example usage: test_PrimeIdeal_add() without return types