Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > pmss12g | GIF version |
Description: Subset relation for the set of partial functions. (Contributed by Mario Carneiro, 31-Dec-2013.) |
Ref | Expression |
---|---|
pmss12g | ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (𝐴 ↑pm 𝐵) ⊆ (𝐶 ↑pm 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xpss12 4727 | . . . . . . 7 ⊢ ((𝐵 ⊆ 𝐷 ∧ 𝐴 ⊆ 𝐶) → (𝐵 × 𝐴) ⊆ (𝐷 × 𝐶)) | |
2 | 1 | ancoms 268 | . . . . . 6 ⊢ ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) → (𝐵 × 𝐴) ⊆ (𝐷 × 𝐶)) |
3 | sstr 3161 | . . . . . . 7 ⊢ ((𝑓 ⊆ (𝐵 × 𝐴) ∧ (𝐵 × 𝐴) ⊆ (𝐷 × 𝐶)) → 𝑓 ⊆ (𝐷 × 𝐶)) | |
4 | 3 | expcom 116 | . . . . . 6 ⊢ ((𝐵 × 𝐴) ⊆ (𝐷 × 𝐶) → (𝑓 ⊆ (𝐵 × 𝐴) → 𝑓 ⊆ (𝐷 × 𝐶))) |
5 | 2, 4 | syl 14 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) → (𝑓 ⊆ (𝐵 × 𝐴) → 𝑓 ⊆ (𝐷 × 𝐶))) |
6 | 5 | anim2d 337 | . . . 4 ⊢ ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) → ((Fun 𝑓 ∧ 𝑓 ⊆ (𝐵 × 𝐴)) → (Fun 𝑓 ∧ 𝑓 ⊆ (𝐷 × 𝐶)))) |
7 | 6 | adantr 276 | . . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → ((Fun 𝑓 ∧ 𝑓 ⊆ (𝐵 × 𝐴)) → (Fun 𝑓 ∧ 𝑓 ⊆ (𝐷 × 𝐶)))) |
8 | ssexg 4137 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ 𝑉) → 𝐴 ∈ V) | |
9 | ssexg 4137 | . . . . 5 ⊢ ((𝐵 ⊆ 𝐷 ∧ 𝐷 ∈ 𝑊) → 𝐵 ∈ V) | |
10 | elpmg 6654 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝑓 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐵 × 𝐴)))) | |
11 | 8, 9, 10 | syl2an 289 | . . . 4 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ 𝑉) ∧ (𝐵 ⊆ 𝐷 ∧ 𝐷 ∈ 𝑊)) → (𝑓 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐵 × 𝐴)))) |
12 | 11 | an4s 588 | . . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (𝑓 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐵 × 𝐴)))) |
13 | elpmg 6654 | . . . 4 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (𝑓 ∈ (𝐶 ↑pm 𝐷) ↔ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐷 × 𝐶)))) | |
14 | 13 | adantl 277 | . . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (𝑓 ∈ (𝐶 ↑pm 𝐷) ↔ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐷 × 𝐶)))) |
15 | 7, 12, 14 | 3imtr4d 203 | . 2 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (𝑓 ∈ (𝐴 ↑pm 𝐵) → 𝑓 ∈ (𝐶 ↑pm 𝐷))) |
16 | 15 | ssrdv 3159 | 1 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (𝐴 ↑pm 𝐵) ⊆ (𝐶 ↑pm 𝐷)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2146 Vcvv 2735 ⊆ wss 3127 × cxp 4618 Fun wfun 5202 (class class class)co 5865 ↑pm cpm 6639 |
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-in1 614 ax-in2 615 ax-io 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-13 2148 ax-14 2149 ax-ext 2157 ax-sep 4116 ax-pow 4169 ax-pr 4203 ax-un 4427 ax-setind 4530 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1459 df-sb 1761 df-eu 2027 df-mo 2028 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-ne 2346 df-ral 2458 df-rex 2459 df-rab 2462 df-v 2737 df-sbc 2961 df-dif 3129 df-un 3131 df-in 3133 df-ss 3140 df-pw 3574 df-sn 3595 df-pr 3596 df-op 3598 df-uni 3806 df-br 3999 df-opab 4060 df-id 4287 df-xp 4626 df-rel 4627 df-cnv 4628 df-co 4629 df-dm 4630 df-iota 5170 df-fun 5210 df-fv 5216 df-ov 5868 df-oprab 5869 df-mpo 5870 df-pm 6641 |
This theorem is referenced by: lmres 13319 |
Copyright terms: Public domain | W3C validator |