Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > elpmg | GIF version |
Description: The predicate "is a partial function". (Contributed by Mario Carneiro, 14-Nov-2013.) |
Ref | Expression |
---|---|
elpmg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝐶 ∧ 𝐶 ⊆ (𝐵 × 𝐴)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | pmvalg 6625 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ↑pm 𝐵) = {𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑔}) | |
2 | 1 | eleq2d 2236 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ 𝐶 ∈ {𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑔})) |
3 | funeq 5208 | . . . . 5 ⊢ (𝑔 = 𝐶 → (Fun 𝑔 ↔ Fun 𝐶)) | |
4 | 3 | elrab 2882 | . . . 4 ⊢ (𝐶 ∈ {𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑔} ↔ (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ∧ Fun 𝐶)) |
5 | 2, 4 | bitrdi 195 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ∧ Fun 𝐶))) |
6 | ancom 264 | . . 3 ⊢ ((𝐶 ∈ 𝒫 (𝐵 × 𝐴) ∧ Fun 𝐶) ↔ (Fun 𝐶 ∧ 𝐶 ∈ 𝒫 (𝐵 × 𝐴))) | |
7 | 5, 6 | bitrdi 195 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝐶 ∧ 𝐶 ∈ 𝒫 (𝐵 × 𝐴)))) |
8 | elex 2737 | . . . . 5 ⊢ (𝐶 ∈ 𝒫 (𝐵 × 𝐴) → 𝐶 ∈ V) | |
9 | 8 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) → 𝐶 ∈ V)) |
10 | xpexg 4718 | . . . . . 6 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → (𝐵 × 𝐴) ∈ V) | |
11 | 10 | ancoms 266 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 × 𝐴) ∈ V) |
12 | ssexg 4121 | . . . . . 6 ⊢ ((𝐶 ⊆ (𝐵 × 𝐴) ∧ (𝐵 × 𝐴) ∈ V) → 𝐶 ∈ V) | |
13 | 12 | expcom 115 | . . . . 5 ⊢ ((𝐵 × 𝐴) ∈ V → (𝐶 ⊆ (𝐵 × 𝐴) → 𝐶 ∈ V)) |
14 | 11, 13 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ⊆ (𝐵 × 𝐴) → 𝐶 ∈ V)) |
15 | elpwg 3567 | . . . . 5 ⊢ (𝐶 ∈ V → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝐶 ⊆ (𝐵 × 𝐴))) | |
16 | 15 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ V → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝐶 ⊆ (𝐵 × 𝐴)))) |
17 | 9, 14, 16 | pm5.21ndd 695 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝐶 ⊆ (𝐵 × 𝐴))) |
18 | 17 | anbi2d 460 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((Fun 𝐶 ∧ 𝐶 ∈ 𝒫 (𝐵 × 𝐴)) ↔ (Fun 𝐶 ∧ 𝐶 ⊆ (𝐵 × 𝐴)))) |
19 | 7, 18 | bitrd 187 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝐶 ∧ 𝐶 ⊆ (𝐵 × 𝐴)))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∈ wcel 2136 {crab 2448 Vcvv 2726 ⊆ wss 3116 𝒫 cpw 3559 × cxp 4602 Fun wfun 5182 (class class class)co 5842 ↑pm cpm 6615 |
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-in1 604 ax-in2 605 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-13 2138 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 ax-un 4411 ax-setind 4514 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-fal 1349 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ne 2337 df-ral 2449 df-rex 2450 df-rab 2453 df-v 2728 df-sbc 2952 df-dif 3118 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-br 3983 df-opab 4044 df-id 4271 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-iota 5153 df-fun 5190 df-fv 5196 df-ov 5845 df-oprab 5846 df-mpo 5847 df-pm 6617 |
This theorem is referenced by: elpm2g 6631 pmss12g 6641 elpm 6645 pmsspw 6649 ennnfonelemj0 12334 lmfss 12894 |
Copyright terms: Public domain | W3C validator |