| 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 5449 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 ⊆ (𝐴 × 𝐵)) | |
| 2 | ffun 5434 | . . . . . . . 8 ⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹) | |
| 3 | 2 | adantr 276 | . . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → Fun 𝐹) |
| 4 | fdm 5437 | . . . . . . . . 9 ⊢ (𝐹:𝐴⟶𝐵 → dom 𝐹 = 𝐴) | |
| 5 | 4 | eleq2d 2276 | . . . . . . . 8 ⊢ (𝐹:𝐴⟶𝐵 → (𝑥 ∈ dom 𝐹 ↔ 𝑥 ∈ 𝐴)) |
| 6 | 5 | biimpar 297 | . . . . . . 7 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ dom 𝐹) |
| 7 | funfvop 5699 | . . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝐹) | |
| 8 | 3, 6, 7 | syl2anc 411 | . . . . . 6 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝐹) |
| 9 | df-br 4048 | . . . . . 6 ⊢ (𝑥𝐹(𝐹‘𝑥) ↔ 〈𝑥, (𝐹‘𝑥)〉 ∈ 𝐹) | |
| 10 | 8, 9 | sylibr 134 | . . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥𝐹(𝐹‘𝑥)) |
| 11 | funfvex 5600 | . . . . . . 7 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ V) | |
| 12 | breq2 4051 | . . . . . . . 8 ⊢ (𝑦 = (𝐹‘𝑥) → (𝑥𝐹𝑦 ↔ 𝑥𝐹(𝐹‘𝑥))) | |
| 13 | 12 | spcegv 2862 | . . . . . . 7 ⊢ ((𝐹‘𝑥) ∈ V → (𝑥𝐹(𝐹‘𝑥) → ∃𝑦 𝑥𝐹𝑦)) |
| 14 | 11, 13 | syl 14 | . . . . . 6 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝑥𝐹(𝐹‘𝑥) → ∃𝑦 𝑥𝐹𝑦)) |
| 15 | 3, 6, 14 | syl2anc 411 | . . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝑥𝐹(𝐹‘𝑥) → ∃𝑦 𝑥𝐹𝑦)) |
| 16 | 10, 15 | mpd 13 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 𝑥𝐹𝑦) |
| 17 | funmo 5291 | . . . . . 6 ⊢ (Fun 𝐹 → ∃*𝑦 𝑥𝐹𝑦) | |
| 18 | 2, 17 | syl 14 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → ∃*𝑦 𝑥𝐹𝑦) |
| 19 | 18 | adantr 276 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → ∃*𝑦 𝑥𝐹𝑦) |
| 20 | eu5 2102 | . . . 4 ⊢ (∃!𝑦 𝑥𝐹𝑦 ↔ (∃𝑦 𝑥𝐹𝑦 ∧ ∃*𝑦 𝑥𝐹𝑦)) | |
| 21 | 16, 19, 20 | sylanbrc 417 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → ∃!𝑦 𝑥𝐹𝑦) |
| 22 | 21 | ralrimiva 2580 | . 2 ⊢ (𝐹:𝐴⟶𝐵 → ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦) |
| 23 | 1, 22 | jca 306 | 1 ⊢ (𝐹:𝐴⟶𝐵 → (𝐹 ⊆ (𝐴 × 𝐵) ∧ ∀𝑥 ∈ 𝐴 ∃!𝑦 𝑥𝐹𝑦)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∃wex 1516 ∃!weu 2055 ∃*wmo 2056 ∈ wcel 2177 ∀wral 2485 Vcvv 2773 ⊆ wss 3167 〈cop 3637 class class class wbr 4047 × cxp 4677 dom cdm 4679 Fun wfun 5270 ⟶wf 5272 ‘cfv 5276 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-14 2180 ax-ext 2188 ax-sep 4166 ax-pow 4222 ax-pr 4257 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ral 2490 df-rex 2491 df-v 2775 df-sbc 3000 df-un 3171 df-in 3173 df-ss 3180 df-pw 3619 df-sn 3640 df-pr 3641 df-op 3643 df-uni 3853 df-br 4048 df-opab 4110 df-id 4344 df-xp 4685 df-rel 4686 df-cnv 4687 df-co 4688 df-dm 4689 df-rn 4690 df-iota 5237 df-fun 5278 df-fn 5279 df-f 5280 df-fv 5284 |
| This theorem is referenced by: dff4im 5733 |
| Copyright terms: Public domain | W3C validator |