Theorem assintopmap 48697

Description: The associative (closed internal binary) operations for a set, expressed with set exponentiation. (Contributed by AV, 20-Jan-2020.)

Assertion

Ref	Expression
assintopmap	⊢ (𝑀 ∈ 𝑉 → ( assIntOp ‘𝑀) = {𝑜 ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∣ 𝑜 assLaw 𝑀})

Distinct variable group:   𝑜,𝑀

Allowed substitution hint:   𝑉(𝑜)

Proof of Theorem assintopmap

Step	Hyp	Ref	Expression
1		assintopval 48696	. 2 ⊢ (𝑀 ∈ 𝑉 → ( assIntOp ‘𝑀) = {𝑜 ∈ ( clIntOp ‘𝑀) ∣ 𝑜 assLaw 𝑀})
2		clintopval 48695	. . 3 ⊢ (𝑀 ∈ 𝑉 → ( clIntOp ‘𝑀) = (𝑀 ↑m (𝑀 × 𝑀)))
3	2	rabeqdv 3406	. 2 ⊢ (𝑀 ∈ 𝑉 → {𝑜 ∈ ( clIntOp ‘𝑀) ∣ 𝑜 assLaw 𝑀} = {𝑜 ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∣ 𝑜 assLaw 𝑀})
4	1, 3	eqtrd 2774	1 ⊢ (𝑀 ∈ 𝑉 → ( assIntOp ‘𝑀) = {𝑜 ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∣ 𝑜 assLaw 𝑀})

Syntax hints:   → wi 4   = wceq 1547   ∈ wcel 2119  {crab 3391   class class class wbr 5072   × cxp 5616  ‘cfv 6485  (class class class)co 7356   ↑_m cmap 8763   assLaw casslaw 48675   clIntOp cclintop 48688   assIntOp cassintop 48689

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pr 5362

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-mpt 5154  df-id 5513  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-iota 6441  df-fun 6487  df-fv 6493  df-ov 7359  df-oprab 7360  df-mpo 7361  df-intop 48690  df-clintop 48691  df-assintop 48692

This theorem is referenced by:  assintop  48700  isassintop  48701