Theorem caonncan 7735

Description: Transfer nncan 11580-shaped laws to vectors of numbers. (Contributed by Stefan O'Rear, 27-Mar-2015.)

Hypotheses

Ref	Expression
caonncan.i	⊢ (𝜑 → 𝐼 ∈ 𝑉)
caonncan.a	⊢ (𝜑 → 𝐴:𝐼⟶𝑆)
caonncan.b	⊢ (𝜑 → 𝐵:𝐼⟶𝑆)
caonncan.z	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑀(𝑥𝑀𝑦)) = 𝑦)

Assertion

Ref	Expression
caonncan	⊢ (𝜑 → (𝐴 ∘f 𝑀(𝐴 ∘f 𝑀𝐵)) = 𝐵)

Distinct variable groups:   𝜑,𝑥,𝑦   𝑥,𝐴,𝑦   𝑦,𝐵   𝑥,𝑀,𝑦   𝑥,𝑆,𝑦

Allowed substitution hints:   𝐵(𝑥)   𝐼(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem caonncan

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		caonncan.a	. . . . 5 ⊢ (𝜑 → 𝐴:𝐼⟶𝑆)
2	1	ffvelcdmda 7082	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐼) → (𝐴‘𝑧) ∈ 𝑆)
3		caonncan.b	. . . . 5 ⊢ (𝜑 → 𝐵:𝐼⟶𝑆)
4	3	ffvelcdmda 7082	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐼) → (𝐵‘𝑧) ∈ 𝑆)
5		caonncan.z	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑀(𝑥𝑀𝑦)) = 𝑦)
6	5	ralrimivva 3206	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑀(𝑥𝑀𝑦)) = 𝑦)
7	6	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐼) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑀(𝑥𝑀𝑦)) = 𝑦)
8		id 23	. . . . . . 7 ⊢ (𝑥 = (𝐴‘𝑧) → 𝑥 = (𝐴‘𝑧))
9		oveq1 7425	. . . . . . 7 ⊢ (𝑥 = (𝐴‘𝑧) → (𝑥𝑀𝑦) = ((𝐴‘𝑧)𝑀𝑦))
10	8, 9	oveq12d 7436	. . . . . 6 ⊢ (𝑥 = (𝐴‘𝑧) → (𝑥𝑀(𝑥𝑀𝑦)) = ((𝐴‘𝑧)𝑀((𝐴‘𝑧)𝑀𝑦)))
11	10	eqeq1d 2763	. . . . 5 ⊢ (𝑥 = (𝐴‘𝑧) → ((𝑥𝑀(𝑥𝑀𝑦)) = 𝑦 ↔ ((𝐴‘𝑧)𝑀((𝐴‘𝑧)𝑀𝑦)) = 𝑦))
12		oveq2 7426	. . . . . . 7 ⊢ (𝑦 = (𝐵‘𝑧) → ((𝐴‘𝑧)𝑀𝑦) = ((𝐴‘𝑧)𝑀(𝐵‘𝑧)))
13	12	oveq2d 7434	. . . . . 6 ⊢ (𝑦 = (𝐵‘𝑧) → ((𝐴‘𝑧)𝑀((𝐴‘𝑧)𝑀𝑦)) = ((𝐴‘𝑧)𝑀((𝐴‘𝑧)𝑀(𝐵‘𝑧))))
14		id 23	. . . . . 6 ⊢ (𝑦 = (𝐵‘𝑧) → 𝑦 = (𝐵‘𝑧))
15	13, 14	eqeq12d 2777	. . . . 5 ⊢ (𝑦 = (𝐵‘𝑧) → (((𝐴‘𝑧)𝑀((𝐴‘𝑧)𝑀𝑦)) = 𝑦 ↔ ((𝐴‘𝑧)𝑀((𝐴‘𝑧)𝑀(𝐵‘𝑧))) = (𝐵‘𝑧)))
16	11, 15	rspc2va 3588	. . . 4 ⊢ ((((𝐴‘𝑧) ∈ 𝑆 ∧ (𝐵‘𝑧) ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑀(𝑥𝑀𝑦)) = 𝑦) → ((𝐴‘𝑧)𝑀((𝐴‘𝑧)𝑀(𝐵‘𝑧))) = (𝐵‘𝑧))
17	2, 4, 7, 16	syl21anc 851	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐼) → ((𝐴‘𝑧)𝑀((𝐴‘𝑧)𝑀(𝐵‘𝑧))) = (𝐵‘𝑧))
18	17	mpteq2dva 5198	. 2 ⊢ (𝜑 → (𝑧 ∈ 𝐼 ↦ ((𝐴‘𝑧)𝑀((𝐴‘𝑧)𝑀(𝐵‘𝑧)))) = (𝑧 ∈ 𝐼 ↦ (𝐵‘𝑧)))
19		caonncan.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
20		fvexd 6898	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐼) → (𝐴‘𝑧) ∈ V)
21		ovexd 7453	. . 3 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐼) → ((𝐴‘𝑧)𝑀(𝐵‘𝑧)) ∈ V)
22	1	feqmptd 6951	. . 3 ⊢ (𝜑 → 𝐴 = (𝑧 ∈ 𝐼 ↦ (𝐴‘𝑧)))
23		fvexd 6898	. . . 4 ⊢ ((𝜑 ∧ 𝑧 ∈ 𝐼) → (𝐵‘𝑧) ∈ V)
24	3	feqmptd 6951	. . . 4 ⊢ (𝜑 → 𝐵 = (𝑧 ∈ 𝐼 ↦ (𝐵‘𝑧)))
25	19, 20, 23, 22, 24	offval2 7711	. . 3 ⊢ (𝜑 → (𝐴 ∘f 𝑀𝐵) = (𝑧 ∈ 𝐼 ↦ ((𝐴‘𝑧)𝑀(𝐵‘𝑧))))
26	19, 20, 21, 22, 25	offval2 7711	. 2 ⊢ (𝜑 → (𝐴 ∘f 𝑀(𝐴 ∘f 𝑀𝐵)) = (𝑧 ∈ 𝐼 ↦ ((𝐴‘𝑧)𝑀((𝐴‘𝑧)𝑀(𝐵‘𝑧)))))
27	18, 26, 24	3eqtr4d 2806	1 ⊢ (𝜑 → (𝐴 ∘f 𝑀(𝐴 ∘f 𝑀𝐵)) = 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ↦ cmpt 5186  ⟶wf 6533  ‘cfv 6537  (class class class)co 7418   ∘_f cof 7689

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-of 7691

This theorem is used by:  psropprmul  22548