| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ss2ixp | Structured version Visualization version GIF version | ||
| Description: Subclass theorem for infinite Cartesian product. (Contributed by NM, 29-Sep-2006.) (Revised by Mario Carneiro, 12-Aug-2016.) |
| Ref | Expression |
|---|---|
| ss2ixp | ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → X𝑥 ∈ 𝐴 𝐵 ⊆ X𝑥 ∈ 𝐴 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssel 3933 | . . . . 5 ⊢ (𝐵 ⊆ 𝐶 → ((𝑓‘𝑥) ∈ 𝐵 → (𝑓‘𝑥) ∈ 𝐶)) | |
| 2 | 1 | ral2imi 3104 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → (∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵 → ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶)) |
| 3 | 2 | anim2d 623 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → ((𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵) → (𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶))) |
| 4 | 3 | ss2abdv 4021 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → {𝑓 ∣ (𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)} ⊆ {𝑓 ∣ (𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶)}) |
| 5 | df-ixp 8884 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑓 ∣ (𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)} | |
| 6 | df-ixp 8884 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐶 = {𝑓 ∣ (𝑓 Fn {𝑥 ∣ 𝑥 ∈ 𝐴} ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶)} | |
| 7 | 4, 5, 6 | 3sstr4g 3992 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → X𝑥 ∈ 𝐴 𝐵 ⊆ X𝑥 ∈ 𝐴 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∈ wcel 2145 {cab 2743 ∀wral 3079 ⊆ wss 3907 Fn wfn 6520 ‘cfv 6525 Xcixp 8883 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3080 df-ss 3924 df-ixp 8884 |
| This theorem is referenced by: ixpeq2 8897 boxcutc 8927 pwcfsdom 10556 prdsvallem 17497 prdshom 17510 sscpwex 17862 wunfunc 17948 wunnat 18006 dprdss 20092 psrbaglefi 22036 ptuni2 23694 ptcld 23731 ptclsg 23733 prdstopn 23746 xkopt 23773 tmdgsum2 24214 ressprdsds 24489 prdsbl 24609 ptrecube 38131 prdstotbnd 38305 ixpssixp 45668 ioorrnopnxrlem 46878 ovnlecvr2 47182 |
| Copyright terms: Public domain | W3C validator |