| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > resixp | GIF version | ||
| Description: Restriction of an element of an infinite Cartesian product. (Contributed by FL, 7-Nov-2011.) (Proof shortened by Mario Carneiro, 31-May-2014.) |
| Ref | Expression |
|---|---|
| resixp | ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) → (𝐹 ↾ 𝐵) ∈ X𝑥 ∈ 𝐵 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | resexg 5041 | . . 3 ⊢ (𝐹 ∈ X𝑥 ∈ 𝐴 𝐶 → (𝐹 ↾ 𝐵) ∈ V) | |
| 2 | 1 | adantl 277 | . 2 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) → (𝐹 ↾ 𝐵) ∈ V) |
| 3 | simpr 110 | . . . . 5 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) → 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) | |
| 4 | elixp2 6839 | . . . . 5 ⊢ (𝐹 ∈ X𝑥 ∈ 𝐴 𝐶 ↔ (𝐹 ∈ V ∧ 𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐶)) | |
| 5 | 3, 4 | sylib 122 | . . . 4 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) → (𝐹 ∈ V ∧ 𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐶)) |
| 6 | 5 | simp2d 1034 | . . 3 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) → 𝐹 Fn 𝐴) |
| 7 | simpl 109 | . . 3 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) → 𝐵 ⊆ 𝐴) | |
| 8 | fnssres 5432 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → (𝐹 ↾ 𝐵) Fn 𝐵) | |
| 9 | 6, 7, 8 | syl2anc 411 | . 2 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) → (𝐹 ↾ 𝐵) Fn 𝐵) |
| 10 | 5 | simp3d 1035 | . . . 4 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) → ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐶) |
| 11 | ssralv 3288 | . . . 4 ⊢ (𝐵 ⊆ 𝐴 → (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ 𝐶 → ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) ∈ 𝐶)) | |
| 12 | 7, 10, 11 | sylc 62 | . . 3 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) → ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) ∈ 𝐶) |
| 13 | fvres 5647 | . . . . 5 ⊢ (𝑥 ∈ 𝐵 → ((𝐹 ↾ 𝐵)‘𝑥) = (𝐹‘𝑥)) | |
| 14 | 13 | eleq1d 2298 | . . . 4 ⊢ (𝑥 ∈ 𝐵 → (((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐶 ↔ (𝐹‘𝑥) ∈ 𝐶)) |
| 15 | 14 | ralbiia 2544 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 ((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐶 ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝑥) ∈ 𝐶) |
| 16 | 12, 15 | sylibr 134 | . 2 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) → ∀𝑥 ∈ 𝐵 ((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐶) |
| 17 | elixp2 6839 | . 2 ⊢ ((𝐹 ↾ 𝐵) ∈ X𝑥 ∈ 𝐵 𝐶 ↔ ((𝐹 ↾ 𝐵) ∈ V ∧ (𝐹 ↾ 𝐵) Fn 𝐵 ∧ ∀𝑥 ∈ 𝐵 ((𝐹 ↾ 𝐵)‘𝑥) ∈ 𝐶)) | |
| 18 | 2, 9, 16, 17 | syl3anbrc 1205 | 1 ⊢ ((𝐵 ⊆ 𝐴 ∧ 𝐹 ∈ X𝑥 ∈ 𝐴 𝐶) → (𝐹 ↾ 𝐵) ∈ X𝑥 ∈ 𝐵 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1002 ∈ wcel 2200 ∀wral 2508 Vcvv 2799 ⊆ wss 3197 ↾ cres 4718 Fn wfn 5309 ‘cfv 5314 Xcixp 6835 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-br 4083 df-opab 4145 df-xp 4722 df-rel 4723 df-cnv 4724 df-co 4725 df-dm 4726 df-res 4728 df-iota 5274 df-fun 5316 df-fn 5317 df-fv 5322 df-ixp 6836 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |