![]() |
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 4606 | . . . . . . 7 ⊢ ((𝐵 ⊆ 𝐷 ∧ 𝐴 ⊆ 𝐶) → (𝐵 × 𝐴) ⊆ (𝐷 × 𝐶)) | |
2 | 1 | ancoms 266 | . . . . . 6 ⊢ ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) → (𝐵 × 𝐴) ⊆ (𝐷 × 𝐶)) |
3 | sstr 3071 | . . . . . . 7 ⊢ ((𝑓 ⊆ (𝐵 × 𝐴) ∧ (𝐵 × 𝐴) ⊆ (𝐷 × 𝐶)) → 𝑓 ⊆ (𝐷 × 𝐶)) | |
4 | 3 | expcom 115 | . . . . . 6 ⊢ ((𝐵 × 𝐴) ⊆ (𝐷 × 𝐶) → (𝑓 ⊆ (𝐵 × 𝐴) → 𝑓 ⊆ (𝐷 × 𝐶))) |
5 | 2, 4 | syl 14 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) → (𝑓 ⊆ (𝐵 × 𝐴) → 𝑓 ⊆ (𝐷 × 𝐶))) |
6 | 5 | anim2d 333 | . . . 4 ⊢ ((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) → ((Fun 𝑓 ∧ 𝑓 ⊆ (𝐵 × 𝐴)) → (Fun 𝑓 ∧ 𝑓 ⊆ (𝐷 × 𝐶)))) |
7 | 6 | adantr 272 | . . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → ((Fun 𝑓 ∧ 𝑓 ⊆ (𝐵 × 𝐴)) → (Fun 𝑓 ∧ 𝑓 ⊆ (𝐷 × 𝐶)))) |
8 | ssexg 4027 | . . . . 5 ⊢ ((𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ 𝑉) → 𝐴 ∈ V) | |
9 | ssexg 4027 | . . . . 5 ⊢ ((𝐵 ⊆ 𝐷 ∧ 𝐷 ∈ 𝑊) → 𝐵 ∈ V) | |
10 | elpmg 6512 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝑓 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐵 × 𝐴)))) | |
11 | 8, 9, 10 | syl2an 285 | . . . 4 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ 𝑉) ∧ (𝐵 ⊆ 𝐷 ∧ 𝐷 ∈ 𝑊)) → (𝑓 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐵 × 𝐴)))) |
12 | 11 | an4s 560 | . . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (𝑓 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐵 × 𝐴)))) |
13 | elpmg 6512 | . . . 4 ⊢ ((𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (𝑓 ∈ (𝐶 ↑pm 𝐷) ↔ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐷 × 𝐶)))) | |
14 | 13 | adantl 273 | . . 3 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (𝑓 ∈ (𝐶 ↑pm 𝐷) ↔ (Fun 𝑓 ∧ 𝑓 ⊆ (𝐷 × 𝐶)))) |
15 | 7, 12, 14 | 3imtr4d 202 | . 2 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (𝑓 ∈ (𝐴 ↑pm 𝐵) → 𝑓 ∈ (𝐶 ↑pm 𝐷))) |
16 | 15 | ssrdv 3069 | 1 ⊢ (((𝐴 ⊆ 𝐶 ∧ 𝐵 ⊆ 𝐷) ∧ (𝐶 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊)) → (𝐴 ↑pm 𝐵) ⊆ (𝐶 ↑pm 𝐷)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 1463 Vcvv 2657 ⊆ wss 3037 × cxp 4497 Fun wfun 5075 (class class class)co 5728 ↑pm cpm 6497 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 586 ax-in2 587 ax-io 681 ax-5 1406 ax-7 1407 ax-gen 1408 ax-ie1 1452 ax-ie2 1453 ax-8 1465 ax-10 1466 ax-11 1467 ax-i12 1468 ax-bndl 1469 ax-4 1470 ax-13 1474 ax-14 1475 ax-17 1489 ax-i9 1493 ax-ial 1497 ax-i5r 1498 ax-ext 2097 ax-sep 4006 ax-pow 4058 ax-pr 4091 ax-un 4315 ax-setind 4412 |
This theorem depends on definitions: df-bi 116 df-3an 947 df-tru 1317 df-fal 1320 df-nf 1420 df-sb 1719 df-eu 1978 df-mo 1979 df-clab 2102 df-cleq 2108 df-clel 2111 df-nfc 2244 df-ne 2283 df-ral 2395 df-rex 2396 df-rab 2399 df-v 2659 df-sbc 2879 df-dif 3039 df-un 3041 df-in 3043 df-ss 3050 df-pw 3478 df-sn 3499 df-pr 3500 df-op 3502 df-uni 3703 df-br 3896 df-opab 3950 df-id 4175 df-xp 4505 df-rel 4506 df-cnv 4507 df-co 4508 df-dm 4509 df-iota 5046 df-fun 5083 df-fv 5089 df-ov 5731 df-oprab 5732 df-mpo 5733 df-pm 6499 |
This theorem is referenced by: lmres 12259 |
Copyright terms: Public domain | W3C validator |