| 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 6745 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ↑pm 𝐵) = {𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑔}) | |
| 2 | 1 | eleq2d 2274 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ (𝐴 ↑pm 𝐵) ↔ 𝐶 ∈ {𝑔 ∈ 𝒫 (𝐵 × 𝐴) ∣ Fun 𝑔})) |
| 3 | funeq 5290 | . . . . 5 ⊢ (𝑔 = 𝐶 → (Fun 𝑔 ↔ Fun 𝐶)) | |
| 4 | 3 | elrab 2928 | . . . 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 2782 | . . . . 5 ⊢ (𝐶 ∈ 𝒫 (𝐵 × 𝐴) → 𝐶 ∈ V) | |
| 9 | 8 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) → 𝐶 ∈ V)) |
| 10 | xpexg 4788 | . . . . . 6 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 ∈ 𝑉) → (𝐵 × 𝐴) ∈ V) | |
| 11 | 10 | ancoms 268 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐵 × 𝐴) ∈ V) |
| 12 | ssexg 4182 | . . . . . 6 ⊢ ((𝐶 ⊆ (𝐵 × 𝐴) ∧ (𝐵 × 𝐴) ∈ V) → 𝐶 ∈ V) | |
| 13 | 12 | expcom 116 | . . . . 5 ⊢ ((𝐵 × 𝐴) ∈ V → (𝐶 ⊆ (𝐵 × 𝐴) → 𝐶 ∈ V)) |
| 14 | 11, 13 | syl 14 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ⊆ (𝐵 × 𝐴) → 𝐶 ∈ V)) |
| 15 | elpwg 3623 | . . . . 5 ⊢ (𝐶 ∈ V → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝐶 ⊆ (𝐵 × 𝐴))) | |
| 16 | 15 | a1i 9 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐶 ∈ V → (𝐶 ∈ 𝒫 (𝐵 × 𝐴) ↔ 𝐶 ⊆ (𝐵 × 𝐴)))) |
| 17 | 9, 14, 16 | pm5.21ndd 706 | . . 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 2175 {crab 2487 Vcvv 2771 ⊆ wss 3165 𝒫 cpw 3615 × cxp 4672 Fun wfun 5264 (class class class)co 5943 ↑pm cpm 6735 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4479 ax-setind 4584 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-ral 2488 df-rex 2489 df-rab 2492 df-v 2773 df-sbc 2998 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-br 4044 df-opab 4105 df-id 4339 df-xp 4680 df-rel 4681 df-cnv 4682 df-co 4683 df-dm 4684 df-iota 5231 df-fun 5272 df-fv 5278 df-ov 5946 df-oprab 5947 df-mpo 5948 df-pm 6737 |
| This theorem is referenced by: elpm2g 6751 pmss12g 6761 elpm 6765 pmsspw 6769 ennnfonelemj0 12714 lmfss 14658 |
| Copyright terms: Public domain | W3C validator |