![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fvco2 | GIF version |
Description: Value of a function composition. Similar to second part of Theorem 3H of [Enderton] p. 47. (Contributed by NM, 9-Oct-2004.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Revised by Stefan O'Rear, 16-Oct-2014.) |
Ref | Expression |
---|---|
fvco2 | ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fnsnfv 5376 | . . . . . 6 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → {(𝐺‘𝑋)} = (𝐺 “ {𝑋})) | |
2 | 1 | imaeq2d 4787 | . . . . 5 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹 “ {(𝐺‘𝑋)}) = (𝐹 “ (𝐺 “ {𝑋}))) |
3 | imaco 4949 | . . . . 5 ⊢ ((𝐹 ∘ 𝐺) “ {𝑋}) = (𝐹 “ (𝐺 “ {𝑋})) | |
4 | 2, 3 | syl6reqr 2140 | . . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺) “ {𝑋}) = (𝐹 “ {(𝐺‘𝑋)})) |
5 | 4 | eleq2d 2158 | . . 3 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋}) ↔ 𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)}))) |
6 | 5 | iotabidv 5014 | . 2 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋})) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)}))) |
7 | dffv3g 5314 | . . 3 ⊢ (𝑋 ∈ 𝐴 → ((𝐹 ∘ 𝐺)‘𝑋) = (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋}))) | |
8 | 7 | adantl 272 | . 2 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋}))) |
9 | funfvex 5335 | . . . 4 ⊢ ((Fun 𝐺 ∧ 𝑋 ∈ dom 𝐺) → (𝐺‘𝑋) ∈ V) | |
10 | 9 | funfni 5127 | . . 3 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐺‘𝑋) ∈ V) |
11 | dffv3g 5314 | . . 3 ⊢ ((𝐺‘𝑋) ∈ V → (𝐹‘(𝐺‘𝑋)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)}))) | |
12 | 10, 11 | syl 14 | . 2 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → (𝐹‘(𝐺‘𝑋)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺‘𝑋)}))) |
13 | 6, 8, 12 | 3eqtr4d 2131 | 1 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1290 ∈ wcel 1439 Vcvv 2620 {csn 3450 “ cima 4455 ∘ ccom 4456 ℩cio 4991 Fn wfn 5023 ‘cfv 5028 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 666 ax-5 1382 ax-7 1383 ax-gen 1384 ax-ie1 1428 ax-ie2 1429 ax-8 1441 ax-10 1442 ax-11 1443 ax-i12 1444 ax-bndl 1445 ax-4 1446 ax-14 1451 ax-17 1465 ax-i9 1469 ax-ial 1473 ax-i5r 1474 ax-ext 2071 ax-sep 3963 ax-pow 4015 ax-pr 4045 |
This theorem depends on definitions: df-bi 116 df-3an 927 df-tru 1293 df-nf 1396 df-sb 1694 df-eu 1952 df-mo 1953 df-clab 2076 df-cleq 2082 df-clel 2085 df-nfc 2218 df-ral 2365 df-rex 2366 df-v 2622 df-sbc 2842 df-un 3004 df-in 3006 df-ss 3013 df-pw 3435 df-sn 3456 df-pr 3457 df-op 3459 df-uni 3660 df-br 3852 df-opab 3906 df-id 4129 df-xp 4458 df-rel 4459 df-cnv 4460 df-co 4461 df-dm 4462 df-rn 4463 df-res 4464 df-ima 4465 df-iota 4993 df-fun 5030 df-fn 5031 df-fv 5036 |
This theorem is referenced by: fvco 5387 fvco3 5388 ofco 5887 updjudhcoinlf 6825 updjudhcoinrg 6826 updjud 6827 caseinl 6836 ctm 6845 enomnilem 6855 |
Copyright terms: Public domain | W3C validator |