| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ofcfeqd2 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for function/constant operation value. (Contributed by Thierry Arnoux, 31-Jan-2017.) |
| Ref | Expression |
|---|---|
| ofcfeqd2.1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵) |
| ofcfeqd2.2 | ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑦𝑅𝐶) = (𝑦𝑃𝐶)) |
| ofcfeqd2.3 | ⊢ (𝜑 → 𝐹 Fn 𝐴) |
| ofcfeqd2.4 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| ofcfeqd2.5 | ⊢ (𝜑 → 𝐶 ∈ 𝑊) |
| Ref | Expression |
|---|---|
| ofcfeqd2 | ⊢ (𝜑 → (𝐹 ∘f/c 𝑅𝐶) = (𝐹 ∘f/c 𝑃𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 7434 | . . . . 5 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑦𝑅𝐶) = ((𝐹‘𝑥)𝑅𝐶)) | |
| 2 | oveq1 7434 | . . . . 5 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑦𝑃𝐶) = ((𝐹‘𝑥)𝑃𝐶)) | |
| 3 | 1, 2 | eqeq12d 2779 | . . . 4 ⊢ (𝑦 = (𝐹‘𝑥) → ((𝑦𝑅𝐶) = (𝑦𝑃𝐶) ↔ ((𝐹‘𝑥)𝑅𝐶) = ((𝐹‘𝑥)𝑃𝐶))) |
| 4 | ofcfeqd2.2 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (𝑦𝑅𝐶) = (𝑦𝑃𝐶)) | |
| 5 | 4 | ralrimiva 3157 | . . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 (𝑦𝑅𝐶) = (𝑦𝑃𝐶)) |
| 6 | 5 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑦 ∈ 𝐵 (𝑦𝑅𝐶) = (𝑦𝑃𝐶)) |
| 7 | ofcfeqd2.1 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵) | |
| 8 | 3, 6, 7 | rspcdva 3580 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥)𝑅𝐶) = ((𝐹‘𝑥)𝑃𝐶)) |
| 9 | 8 | mpteq2dva 5200 | . 2 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅𝐶)) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑃𝐶))) |
| 10 | ofcfeqd2.3 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) | |
| 11 | ofcfeqd2.4 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 12 | ofcfeqd2.5 | . . 3 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
| 13 | eqidd 2764 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 14 | 10, 11, 12, 13 | ofcfval 34783 | . 2 ⊢ (𝜑 → (𝐹 ∘f/c 𝑅𝐶) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑅𝐶))) |
| 15 | 10, 11, 12, 13 | ofcfval 34783 | . 2 ⊢ (𝜑 → (𝐹 ∘f/c 𝑃𝐶) = (𝑥 ∈ 𝐴 ↦ ((𝐹‘𝑥)𝑃𝐶))) |
| 16 | 9, 14, 15 | 3eqtr4d 2808 | 1 ⊢ (𝜑 → (𝐹 ∘f/c 𝑅𝐶) = (𝐹 ∘f/c 𝑃𝐶)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 ∀wral 3079 ↦ cmpt 5188 Fn wfn 6541 ‘cfv 6546 (class class class)co 7427 ∘f/c cofc 34780 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pr 5394 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-id 5549 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-ov 7430 df-oprab 7431 df-mpo 7432 df-ofc 34781 |
| This theorem is used by: coinfliplem 35164 |
| Copyright terms: Public domain | W3C validator |