| 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 6814 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ↑pm 𝐵) = {𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑔}) | |
| 2 | 1 | eleq2d 2299 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ 𝐶 ∈ {𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑔})) |
| 3 | funeq 5338 | . . . . 5 ⊢ (𝑔 = 𝐶 → (Fun 𝑔 ↔ Fun 𝐶)) | |
| 4 | 3 | elrab 2959 | . . . 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 2811 | . . . . 5 ⊢ (𝐶 ∈ 𝒫 (𝐵 × 𝐴) → 𝐶 ∈ V) | |
| 9 | 8 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) → 𝐶 ∈ V)) |
| 10 | xpexg 4833 | . . . . . 6 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → (𝐵 × 𝐴) ∈ V) | |
| 11 | 10 | ancoms 268 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 × 𝐴) ∈ V) |
| 12 | ssexg 4223 | . . . . . 6 ⊢ ((𝐶 ⊆ (𝐵 × 𝐴) ∧ (𝐵 × 𝐴) ∈ V) → 𝐶 ∈ V) | |
| 13 | 12 | expcom 116 | . . . . 5 ⊢ ((𝐵 × 𝐴) ∈ V → (𝐶 ⊆ (𝐵 × 𝐴) → 𝐶 ∈ V)) |
| 14 | 11, 13 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ⊆ (𝐵 × 𝐴) → 𝐶 ∈ V)) |
| 15 | elpwg 3657 | . . . . 5 ⊢ (𝐶 ∈ V → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝐶 ⊆ (𝐵 × 𝐴))) | |
| 16 | 15 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ V → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝐶 ⊆ (𝐵 × 𝐴)))) |
| 17 | 9, 14, 16 | pm5.21ndd 710 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝐶 ⊆ (𝐵 × 𝐴))) |
| 18 | 17 | anbi2d 464 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((Fun 𝐶 ∧ 𝐶 ∈ 𝒫 (𝐵 × 𝐴)) ↔ (Fun 𝐶 ∧ 𝐶 ⊆ (𝐵 × 𝐴)))) |
| 19 | 7, 18 | bitrd 188 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ (Fun 𝐶 ∧ 𝐶 ⊆ (𝐵 × 𝐴)))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2200 {crab 2512 Vcvv 2799 ⊆ wss 3197 𝒫 cpw 3649 × cxp 4717 Fun wfun 5312 (class class class)co 6007 ↑pm cpm 6804 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-br 4084 df-opab 4146 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-iota 5278 df-fun 5320 df-fv 5326 df-ov 6010 df-oprab 6011 df-mpo 6012 df-pm 6806 |
| This theorem is referenced by: elpm2g 6820 pmss12g 6830 elpm 6834 pmsspw 6838 ennnfonelemj0 12987 lmfss 14933 |
| Copyright terms: Public domain | W3C validator |