| 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 6933 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ↑pm 𝐵) = {𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑔}) | |
| 2 | 1 | eleq2d 2308 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ 𝐶 ∈ {𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑔})) |
| 3 | funeq 5397 | . . . . 5 ⊢ (𝑔 = 𝐶 → (Fun 𝑔 ↔ Fun 𝐶)) | |
| 4 | 3 | elrab 2982 | . . . 4 ⊢ (𝐶 ∈ {𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑔} ↔ (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ∧ Fun 𝐶)) |
| 5 | 2, 4 | bitrdi 196 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ∧ Fun 𝐶))) |
| 6 | ancom 266 | . . 3 ⊢ ((𝐶 ∈ 𝒫 (𝐵 × 𝐴) ∧ Fun 𝐶) ↔ (Fun 𝐶 ∧ 𝐶 ∈ 𝒫 (𝐵 × 𝐴))) | |
| 7 | 5, 6 | bitrdi 196 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝐶 ∧ 𝐶 ∈ 𝒫 (𝐵 × 𝐴)))) |
| 8 | elex 2833 | . . . . 5 ⊢ (𝐶 ∈ 𝒫 (𝐵 × 𝐴) → 𝐶 ∈ V) | |
| 9 | 8 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) → 𝐶 ∈ V)) |
| 10 | xpexg 4889 | . . . . . 6 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → (𝐵 × 𝐴) ∈ V) | |
| 11 | 10 | ancoms 268 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 × 𝐴) ∈ V) |
| 12 | ssexg 4272 | . . . . . 6 ⊢ ((𝐶 ⊆ (𝐵 × 𝐴) ∧ (𝐵 × 𝐴) ∈ V) → 𝐶 ∈ V) | |
| 13 | 12 | expcom 116 | . . . . 5 ⊢ ((𝐵 × 𝐴) ∈ V → (𝐶 ⊆ (𝐵 × 𝐴) → 𝐶 ∈ V)) |
| 14 | 11, 13 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ⊆ (𝐵 × 𝐴) → 𝐶 ∈ V)) |
| 15 | elpwg 3696 | . . . . 5 ⊢ (𝐶 ∈ V → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝐶 ⊆ (𝐵 × 𝐴))) | |
| 16 | 15 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ V → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝐶 ⊆ (𝐵 × 𝐴)))) |
| 17 | 9, 14, 16 | pm5.21ndd 717 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝐶 ⊆ (𝐵 × 𝐴))) |
| 18 | 17 | anbi2d 468 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((Fun 𝐶 ∧ 𝐶 ∈ 𝒫 (𝐵 × 𝐴)) ↔ (Fun 𝐶 ∧ 𝐶 ⊆ (𝐵 × 𝐴)))) |
| 19 | 7, 18 | bitrd 188 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝐶 ∧ 𝐶 ⊆ (𝐵 × 𝐴)))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2209 {crab 2532 Vcvv 2821 ⊆ wss 3220 𝒫 cpw 3688 × cxp 4772 Fun wfun 5371 (class class class)co 6085 ↑pm cpm 6923 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-iota 5337 df-fun 5379 df-fv 5385 df-ov 6088 df-oprab 6089 df-mpo 6090 df-pm 6925 |
| This theorem is used by: elpm2g 6939 pmss12g 6956 elpm 6960 pmsspw 6964 ennnfonelemj0 13292 lmfss 15345 |
| Copyright terms: Public domain | W3C validator |