Theorem oveqrspc2v 5973

Description: Restricted specialization of operands, using implicit substitution. (Contributed by Mario Carneiro, 6-Dec-2014.)

Hypothesis

Ref	Expression
oveqrspc2v.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦))

Assertion

Ref	Expression
oveqrspc2v	⊢ ((𝜑 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) → (𝑋𝐹𝑌) = (𝑋𝐺𝑌))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐹,𝑦   𝜑,𝑥,𝑦   𝑦,𝑌   𝑥,𝐺,𝑦   𝑥,𝑋,𝑦

Allowed substitution hint:   𝑌(𝑥)

Proof of Theorem oveqrspc2v

Step	Hyp	Ref	Expression
1		oveqrspc2v.1	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦))
2	1	ralrimivva 2588	. 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝐹𝑦) = (𝑥𝐺𝑦))
3		oveq1 5953	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥𝐹𝑦) = (𝑋𝐹𝑦))
4		oveq1 5953	. . . 4 ⊢ (𝑥 = 𝑋 → (𝑥𝐺𝑦) = (𝑋𝐺𝑦))
5	3, 4	eqeq12d 2220	. . 3 ⊢ (𝑥 = 𝑋 → ((𝑥𝐹𝑦) = (𝑥𝐺𝑦) ↔ (𝑋𝐹𝑦) = (𝑋𝐺𝑦)))
6		oveq2 5954	. . . 4 ⊢ (𝑦 = 𝑌 → (𝑋𝐹𝑦) = (𝑋𝐹𝑌))
7		oveq2 5954	. . . 4 ⊢ (𝑦 = 𝑌 → (𝑋𝐺𝑦) = (𝑋𝐺𝑌))
8	6, 7	eqeq12d 2220	. . 3 ⊢ (𝑦 = 𝑌 → ((𝑋𝐹𝑦) = (𝑋𝐺𝑦) ↔ (𝑋𝐹𝑌) = (𝑋𝐺𝑌)))
9	5, 8	rspc2v 2890	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝐹𝑦) = (𝑥𝐺𝑦) → (𝑋𝐹𝑌) = (𝑋𝐺𝑌)))
10	2, 9	mpan9 281	1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) → (𝑋𝐹𝑌) = (𝑋𝐺𝑌))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1373   ∈ wcel 2176  ∀wral 2484  (class class class)co 5946

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187

This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-v 2774  df-un 3170  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-br 4046  df-iota 5233  df-fv 5280  df-ov 5949

This theorem is referenced by:  grpidpropdg  13239  sgrppropd  13278  mndpropd  13305  grpsubpropd2  13470  cmnpropd  13664  rngpropd  13750  ringpropd  13833  lmodprop2d  14143  lsspropdg  14226