| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dff3im | GIF version | ||
| Description: Property of a mapping. (Contributed by Jim Kingdon, 4-Jan-2019.) |
| Ref | Expression |
|---|---|
| dff3im | ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fssxp 5553 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵)) | |
| 2 | ffun 5534 | . . . . . . . 8 ⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹) | |
| 3 | 2 | adantr 276 | . . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → Fun 𝐹) |
| 4 | fdm 5537 | . . . . . . . . 9 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴) | |
| 5 | 4 | eleq2d 2308 | . . . . . . . 8 ⊢ (𝐹:𝐴⟶𝐵 → (𝑥 ∈ dom 𝐹 ↔ 𝑥 ∈ 𝐴)) |
| 6 | 5 | biimpar 297 | . . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ dom 𝐹) |
| 7 | funfvop 5815 | . . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝐹) | |
| 8 | 3, 6, 7 | syl2anc 415 | . . . . . 6 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝐹) |
| 9 | df-br 4129 | . . . . . 6 ⊢ (𝑥𝐹(𝐹‘𝑥) ↔ 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝐹) | |
| 10 | 8, 9 | sylibr 134 | . . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥𝐹(𝐹‘𝑥)) |
| 11 | funfvex 5710 | . . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ V) | |
| 12 | breq2 4132 | . . . . . . . 8 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑥𝐹𝑦 ↔ 𝑥𝐹(𝐹‘𝑥))) | |
| 13 | 12 | spcegv 2913 | . . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ V → (𝑥𝐹(𝐹‘𝑥) → ∃𝑦 𝑥𝐹𝑦)) |
| 14 | 11, 13 | syl 14 | . . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝑥𝐹(𝐹‘𝑥) → ∃𝑦 𝑥𝐹𝑦)) |
| 15 | 3, 6, 14 | syl2anc 415 | . . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝑥𝐹(𝐹‘𝑥) → ∃𝑦 𝑥𝐹𝑦)) |
| 16 | 10, 15 | mpd 13 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 𝑥𝐹𝑦) |
| 17 | funmo 5390 | . . . . . 6 ⊢ (Fun 𝐹 → ∃*𝑦 𝑥𝐹𝑦) | |
| 18 | 2, 17 | syl 14 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → ∃*𝑦 𝑥𝐹𝑦) |
| 19 | 18 | adantr 276 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → ∃*𝑦 𝑥𝐹𝑦) |
| 20 | eu5 2134 | . . . 4 ⊢ (∃!𝑦 𝑥𝐹𝑦 ↔ (∃𝑦 𝑥𝐹𝑦 ∧ ∃*𝑦 𝑥𝐹𝑦)) | |
| 21 | 16, 19, 20 | sylanbrc 421 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → ∃!𝑦 𝑥𝐹𝑦) |
| 22 | 21 | ralrimiva 2623 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦) |
| 23 | 1, 22 | jca 306 | 1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∃wex 1545 ∃!weu 2086 ∃*wmo 2087 ∈ wcel 2209 ∀wral 2528 Vcvv 2821 ⊆ wss 3220 〈cop 3711 class class class wbr 4128 × cxp 4770 dom cdm 4772 Fun wfun 5369 ⟶wf 5371 ‘cfv 5375 |
| 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-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 4247 ax-pow 4309 ax-pr 4344 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 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-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-br 4129 df-opab 4191 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-fv 5383 |
| This theorem is referenced by: dff4im 5848 |
| Copyright terms: Public domain | W3C validator |