![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ovanraleqv | Structured version Visualization version GIF version |
Description: Equality theorem for a conjunction with an operation values within a restricted universal quantification. Technical theorem to be used to reduce the size of a significant number of proofs. (Contributed by AV, 13-Aug-2022.) |
Ref | Expression |
---|---|
ovanraleqv.1 | ⊢ (𝐵 = 𝑋 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
ovanraleqv | ⊢ (𝐵 = 𝑋 → (∀𝑥 ∈ 𝑉 (𝜑 ∧ (𝐴 · 𝐵) = 𝐶) ↔ ∀𝑥 ∈ 𝑉 (𝜓 ∧ (𝐴 · 𝑋) = 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ovanraleqv.1 | . . 3 ⊢ (𝐵 = 𝑋 → (𝜑 ↔ 𝜓)) | |
2 | oveq2 7143 | . . . 4 ⊢ (𝐵 = 𝑋 → (𝐴 · 𝐵) = (𝐴 · 𝑋)) | |
3 | 2 | eqeq1d 2800 | . . 3 ⊢ (𝐵 = 𝑋 → ((𝐴 · 𝐵) = 𝐶 ↔ (𝐴 · 𝑋) = 𝐶)) |
4 | 1, 3 | anbi12d 633 | . 2 ⊢ (𝐵 = 𝑋 → ((𝜑 ∧ (𝐴 · 𝐵) = 𝐶) ↔ (𝜓 ∧ (𝐴 · 𝑋) = 𝐶))) |
5 | 4 | ralbidv 3162 | 1 ⊢ (𝐵 = 𝑋 → (∀𝑥 ∈ 𝑉 (𝜑 ∧ (𝐴 · 𝐵) = 𝐶) ↔ ∀𝑥 ∈ 𝑉 (𝜓 ∧ (𝐴 · 𝑋) = 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∀wral 3106 (class class class)co 7135 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-ral 3111 df-v 3443 df-un 3886 df-in 3888 df-ss 3898 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-iota 6283 df-fv 6332 df-ov 7138 |
This theorem is referenced by: mgmidmo 17862 ismgmid 17867 ismgmid2 17870 mgmidsssn0 17874 gsumvalx 17878 gsumress 17884 sgrpidmnd 17908 ismndd 17925 mnd1 17944 gsumvallem2 17990 mhmmnd 18213 rngurd 30907 signsw0g 31936 signswmnd 31937 exidu1 35294 cmpidelt 35297 exidres 35316 exidresid 35317 isrngod 35336 rngoideu 35341 zlidlring 44552 2zrngamnd 44565 |
Copyright terms: Public domain | W3C validator |