![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > abfmpel | Structured version Visualization version GIF version |
Description: Membership in an element of a mapping function-defined family of sets. (Contributed by Thierry Arnoux, 19-Oct-2016.) |
Ref | Expression |
---|---|
abfmpel.1 | ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∣ 𝜑}) |
abfmpel.2 | ⊢ {𝑦 ∣ 𝜑} ∈ V |
abfmpel.3 | ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
abfmpel | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ∈ (𝐹‘𝐴) ↔ 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | abfmpel.2 | . . . . . . 7 ⊢ {𝑦 ∣ 𝜑} ∈ V | |
2 | 1 | csbex 5301 | . . . . . 6 ⊢ ⦋𝐴 / 𝑥⦌{𝑦 ∣ 𝜑} ∈ V |
3 | abfmpel.1 | . . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝑉 ↦ {𝑦 ∣ 𝜑}) | |
4 | 3 | fvmpts 6991 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ ⦋𝐴 / 𝑥⦌{𝑦 ∣ 𝜑} ∈ V) → (𝐹‘𝐴) = ⦋𝐴 / 𝑥⦌{𝑦 ∣ 𝜑}) |
5 | 2, 4 | mpan2 688 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐹‘𝐴) = ⦋𝐴 / 𝑥⦌{𝑦 ∣ 𝜑}) |
6 | csbab 4429 | . . . . 5 ⊢ ⦋𝐴 / 𝑥⦌{𝑦 ∣ 𝜑} = {𝑦 ∣ [𝐴 / 𝑥]𝜑} | |
7 | 5, 6 | eqtrdi 2780 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝐹‘𝐴) = {𝑦 ∣ [𝐴 / 𝑥]𝜑}) |
8 | 7 | eleq2d 2811 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐵 ∈ (𝐹‘𝐴) ↔ 𝐵 ∈ {𝑦 ∣ [𝐴 / 𝑥]𝜑})) |
9 | 8 | adantr 480 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ∈ (𝐹‘𝐴) ↔ 𝐵 ∈ {𝑦 ∣ [𝐴 / 𝑥]𝜑})) |
10 | simpl 482 | . . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑦 = 𝐵) → 𝐴 ∈ 𝑉) | |
11 | abfmpel.3 | . . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜑 ↔ 𝜓)) | |
12 | 11 | ancoms 458 | . . . . . . . 8 ⊢ ((𝑦 = 𝐵 ∧ 𝑥 = 𝐴) → (𝜑 ↔ 𝜓)) |
13 | 12 | adantll 711 | . . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑦 = 𝐵) ∧ 𝑥 = 𝐴) → (𝜑 ↔ 𝜓)) |
14 | 10, 13 | sbcied 3814 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑦 = 𝐵) → ([𝐴 / 𝑥]𝜑 ↔ 𝜓)) |
15 | 14 | ex 412 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝑦 = 𝐵 → ([𝐴 / 𝑥]𝜑 ↔ 𝜓))) |
16 | 15 | alrimiv 1922 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ∀𝑦(𝑦 = 𝐵 → ([𝐴 / 𝑥]𝜑 ↔ 𝜓))) |
17 | elabgt 3654 | . . . 4 ⊢ ((𝐵 ∈ 𝑊 ∧ ∀𝑦(𝑦 = 𝐵 → ([𝐴 / 𝑥]𝜑 ↔ 𝜓))) → (𝐵 ∈ {𝑦 ∣ [𝐴 / 𝑥]𝜑} ↔ 𝜓)) | |
18 | 16, 17 | sylan2 592 | . . 3 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → (𝐵 ∈ {𝑦 ∣ [𝐴 / 𝑥]𝜑} ↔ 𝜓)) |
19 | 18 | ancoms 458 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ∈ {𝑦 ∣ [𝐴 / 𝑥]𝜑} ↔ 𝜓)) |
20 | 9, 19 | bitrd 279 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 ∈ (𝐹‘𝐴) ↔ 𝜓)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∀wal 1531 = wceq 1533 ∈ wcel 2098 {cab 2701 Vcvv 3466 [wsbc 3769 ⦋csb 3885 ↦ cmpt 5221 ‘cfv 6533 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-sep 5289 ax-nul 5296 ax-pr 5417 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ral 3054 df-rex 3063 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-nul 4315 df-if 4521 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-br 5139 df-opab 5201 df-mpt 5222 df-id 5564 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-iota 6485 df-fun 6535 df-fv 6541 |
This theorem is referenced by: issiga 33565 ismeas 33652 |
Copyright terms: Public domain | W3C validator |