Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mptfvex | GIF version |
Description: Sufficient condition for a maps-to notation to be set-like. (Contributed by Mario Carneiro, 3-Jul-2019.) |
Ref | Expression |
---|---|
fvmpt2.1 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) |
Ref | Expression |
---|---|
mptfvex | ⊢ ((∀𝑥 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐹‘𝐶) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | csbeq1 3006 | . . 3 ⊢ (𝑦 = 𝐶 → ⦋𝑦 / 𝑥⦌𝐵 = ⦋𝐶 / 𝑥⦌𝐵) | |
2 | fvmpt2.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
3 | nfcv 2281 | . . . . 5 ⊢ Ⅎ𝑦𝐵 | |
4 | nfcsb1v 3035 | . . . . 5 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 | |
5 | csbeq1a 3012 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝐵 = ⦋𝑦 / 𝑥⦌𝐵) | |
6 | 3, 4, 5 | cbvmpt 4023 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐵) |
7 | 2, 6 | eqtri 2160 | . . 3 ⊢ 𝐹 = (𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐵) |
8 | 1, 7 | fvmptss2 5496 | . 2 ⊢ (𝐹‘𝐶) ⊆ ⦋𝐶 / 𝑥⦌𝐵 |
9 | elex 2697 | . . . . . 6 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ V) | |
10 | 9 | alimi 1431 | . . . . 5 ⊢ (∀𝑥 𝐵 ∈ 𝑉 → ∀𝑥 𝐵 ∈ V) |
11 | 3 | nfel1 2292 | . . . . . 6 ⊢ Ⅎ𝑦 𝐵 ∈ V |
12 | 4 | nfel1 2292 | . . . . . 6 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐵 ∈ V |
13 | 5 | eleq1d 2208 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐵 ∈ V ↔ ⦋𝑦 / 𝑥⦌𝐵 ∈ V)) |
14 | 11, 12, 13 | cbval 1727 | . . . . 5 ⊢ (∀𝑥 𝐵 ∈ V ↔ ∀𝑦⦋𝑦 / 𝑥⦌𝐵 ∈ V) |
15 | 10, 14 | sylib 121 | . . . 4 ⊢ (∀𝑥 𝐵 ∈ 𝑉 → ∀𝑦⦋𝑦 / 𝑥⦌𝐵 ∈ V) |
16 | 1 | eleq1d 2208 | . . . . 5 ⊢ (𝑦 = 𝐶 → (⦋𝑦 / 𝑥⦌𝐵 ∈ V ↔ ⦋𝐶 / 𝑥⦌𝐵 ∈ V)) |
17 | 16 | spcgv 2773 | . . . 4 ⊢ (𝐶 ∈ 𝑊 → (∀𝑦⦋𝑦 / 𝑥⦌𝐵 ∈ V → ⦋𝐶 / 𝑥⦌𝐵 ∈ V)) |
18 | 15, 17 | syl5 32 | . . 3 ⊢ (𝐶 ∈ 𝑊 → (∀𝑥 𝐵 ∈ 𝑉 → ⦋𝐶 / 𝑥⦌𝐵 ∈ V)) |
19 | 18 | impcom 124 | . 2 ⊢ ((∀𝑥 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ⦋𝐶 / 𝑥⦌𝐵 ∈ V) |
20 | ssexg 4067 | . 2 ⊢ (((𝐹‘𝐶) ⊆ ⦋𝐶 / 𝑥⦌𝐵 ∧ ⦋𝐶 / 𝑥⦌𝐵 ∈ V) → (𝐹‘𝐶) ∈ V) | |
21 | 8, 19, 20 | sylancr 410 | 1 ⊢ ((∀𝑥 𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐹‘𝐶) ∈ V) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∀wal 1329 = wceq 1331 ∈ wcel 1480 Vcvv 2686 ⦋csb 3003 ⊆ wss 3071 ↦ cmpt 3989 ‘cfv 5123 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ral 2421 df-rex 2422 df-v 2688 df-sbc 2910 df-csb 3004 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-iota 5088 df-fun 5125 df-fv 5131 |
This theorem is referenced by: mpofvex 6101 xpcomco 6720 |
Copyright terms: Public domain | W3C validator |