| Mathbox for BTernaryTau |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > fnfvintima | Structured version Visualization version GIF version | ||
| Description: Condition for a function value to equal the intersection of an image that contains it. (Contributed by BTernaryTau, 23-Jun-2026.) |
| Ref | Expression |
|---|---|
| fnfvintima | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqimss 3966 | . . 3 ⊢ ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) → (𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵)) | |
| 2 | fnssintima 7372 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → ((𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥))) | |
| 3 | 2 | 3adant3 1150 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥))) |
| 4 | 1, 3 | imbitrid 247 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) → ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥))) |
| 5 | 3 | biimprd 251 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥) → (𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵))) |
| 6 | fnfvima 7239 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹 “ 𝐵)) | |
| 7 | intss1 4922 | . . . . 5 ⊢ ((𝐹‘𝐶) ∈ (𝐹 “ 𝐵) → ∩ (𝐹 “ 𝐵) ⊆ (𝐹‘𝐶)) | |
| 8 | 6, 7 | syl 18 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ∩ (𝐹 “ 𝐵) ⊆ (𝐹‘𝐶)) |
| 9 | 5, 8 | jctird 536 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥) → ((𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵) ∧ ∩ (𝐹 “ 𝐵) ⊆ (𝐹‘𝐶)))) |
| 10 | eqss 3923 | . . 3 ⊢ ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) ↔ ((𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵) ∧ ∩ (𝐹 “ 𝐵) ⊆ (𝐹‘𝐶))) | |
| 11 | 9, 10 | imbitrrdi 255 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥) → (𝐹‘𝐶) = ∩ (𝐹 “ 𝐵))) |
| 12 | 4, 11 | impbid 215 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ∀wral 3076 ⊆ wss 3895 ∩ cint 4906 “ cima 5653 Fn wfn 6533 ‘cfv 6538 |
| 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 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| 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 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-fv 6546 |
| This theorem is used by: dfscott2 35784 |
| Copyright terms: Public domain | W3C validator |