Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > imaeqsexv | Structured version Visualization version GIF version |
Description: Substitute a function value into an existential quantifier over an image. (Contributed by Scott Fenton, 27-Sep-2024.) |
Ref | Expression |
---|---|
imaeqsex.1 | ⊢ (𝑥 = (𝐹‘𝑦) → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
imaeqsexv | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ∃𝑦 ∈ 𝐵 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rex 3069 | . . 3 ⊢ (∃𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ∃𝑥(𝑥 ∈ (𝐹 “ 𝐵) ∧ 𝜑)) | |
2 | fvelimab 6823 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝑥 ∈ (𝐹 “ 𝐵) ↔ ∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥)) | |
3 | 2 | anbi1d 629 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → ((𝑥 ∈ (𝐹 “ 𝐵) ∧ 𝜑) ↔ (∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑))) |
4 | 3 | exbidv 1925 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥(𝑥 ∈ (𝐹 “ 𝐵) ∧ 𝜑) ↔ ∃𝑥(∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑))) |
5 | 1, 4 | syl5bb 282 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ∃𝑥(∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑))) |
6 | rexcom4 3179 | . . 3 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑥((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ ∃𝑥∃𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 𝑥 ∧ 𝜑)) | |
7 | eqcom 2745 | . . . . . . 7 ⊢ ((𝐹‘𝑦) = 𝑥 ↔ 𝑥 = (𝐹‘𝑦)) | |
8 | 7 | anbi1i 623 | . . . . . 6 ⊢ (((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ (𝑥 = (𝐹‘𝑦) ∧ 𝜑)) |
9 | 8 | exbii 1851 | . . . . 5 ⊢ (∃𝑥((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ ∃𝑥(𝑥 = (𝐹‘𝑦) ∧ 𝜑)) |
10 | fvex 6769 | . . . . . 6 ⊢ (𝐹‘𝑦) ∈ V | |
11 | imaeqsex.1 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝑦) → (𝜑 ↔ 𝜓)) | |
12 | 10, 11 | ceqsexv 3469 | . . . . 5 ⊢ (∃𝑥(𝑥 = (𝐹‘𝑦) ∧ 𝜑) ↔ 𝜓) |
13 | 9, 12 | bitri 274 | . . . 4 ⊢ (∃𝑥((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ 𝜓) |
14 | 13 | rexbii 3177 | . . 3 ⊢ (∃𝑦 ∈ 𝐵 ∃𝑥((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐵 𝜓) |
15 | r19.41v 3273 | . . . 4 ⊢ (∃𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ (∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑)) | |
16 | 15 | exbii 1851 | . . 3 ⊢ (∃𝑥∃𝑦 ∈ 𝐵 ((𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ ∃𝑥(∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑)) |
17 | 6, 14, 16 | 3bitr3ri 301 | . 2 ⊢ (∃𝑥(∃𝑦 ∈ 𝐵 (𝐹‘𝑦) = 𝑥 ∧ 𝜑) ↔ ∃𝑦 ∈ 𝐵 𝜓) |
18 | 5, 17 | bitrdi 286 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (∃𝑥 ∈ (𝐹 “ 𝐵)𝜑 ↔ ∃𝑦 ∈ 𝐵 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∃wex 1783 ∈ wcel 2108 ∃wrex 3064 ⊆ wss 3883 “ cima 5583 Fn wfn 6413 ‘cfv 6418 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-fv 6426 |
This theorem is referenced by: imaeqsalv 33594 |
Copyright terms: Public domain | W3C validator |