![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > oveqrspc2v | GIF version |
Description: Restricted specialization of operands, using implicit substitution. (Contributed by Mario Carneiro, 6-Dec-2014.) |
Ref | Expression |
---|---|
oveqrspc2v.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦)) |
Ref | Expression |
---|---|
oveqrspc2v | ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) → (𝑋𝐹𝑌) = (𝑋𝐺𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oveqrspc2v.1 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝑥𝐹𝑦) = (𝑥𝐺𝑦)) | |
2 | 1 | ralrimivva 2559 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝐹𝑦) = (𝑥𝐺𝑦)) |
3 | oveq1 5876 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥𝐹𝑦) = (𝑋𝐹𝑦)) | |
4 | oveq1 5876 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑥𝐺𝑦) = (𝑋𝐺𝑦)) | |
5 | 3, 4 | eqeq12d 2192 | . . 3 ⊢ (𝑥 = 𝑋 → ((𝑥𝐹𝑦) = (𝑥𝐺𝑦) ↔ (𝑋𝐹𝑦) = (𝑋𝐺𝑦))) |
6 | oveq2 5877 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑋𝐹𝑦) = (𝑋𝐹𝑌)) | |
7 | oveq2 5877 | . . . 4 ⊢ (𝑦 = 𝑌 → (𝑋𝐺𝑦) = (𝑋𝐺𝑌)) | |
8 | 6, 7 | eqeq12d 2192 | . . 3 ⊢ (𝑦 = 𝑌 → ((𝑋𝐹𝑦) = (𝑋𝐺𝑦) ↔ (𝑋𝐹𝑌) = (𝑋𝐺𝑌))) |
9 | 5, 8 | rspc2v 2854 | . 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝐹𝑦) = (𝑥𝐺𝑦) → (𝑋𝐹𝑌) = (𝑋𝐺𝑌))) |
10 | 2, 9 | mpan9 281 | 1 ⊢ ((𝜑 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵)) → (𝑋𝐹𝑌) = (𝑋𝐺𝑌)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 ∀wral 2455 (class class class)co 5869 |
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 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-v 2739 df-un 3133 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-br 4001 df-iota 5174 df-fv 5220 df-ov 5872 |
This theorem is referenced by: grpidpropdg 12682 mndpropd 12730 grpsubpropd2 12861 cmnpropd 12922 ringpropd 13040 |
Copyright terms: Public domain | W3C validator |