![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > f1ocnvd | Structured version Visualization version GIF version |
Description: Describe an implicit one-to-one onto function. (Contributed by Mario Carneiro, 30-Apr-2015.) |
Ref | Expression |
---|---|
f1od.1 | ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶) |
f1od.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑊) |
f1od.3 | ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐷 ∈ 𝑋) |
f1od.4 | ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 = 𝐷))) |
Ref | Expression |
---|---|
f1ocnvd | ⊢ (𝜑 → (𝐹:𝐴–1-1-onto→𝐵 ∧ ◡𝐹 = (𝑦 ∈ 𝐵 ↦ 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f1od.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝑊) | |
2 | 1 | ralrimiva 3104 | . . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝑊) |
3 | f1od.1 | . . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶) | |
4 | 3 | fnmpt 6181 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝑊 → 𝐹 Fn 𝐴) |
5 | 2, 4 | syl 17 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
6 | f1od.3 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → 𝐷 ∈ 𝑋) | |
7 | 6 | ralrimiva 3104 | . . . . 5 ⊢ (𝜑 → ∀𝑦 ∈ 𝐵 𝐷 ∈ 𝑋) |
8 | eqid 2760 | . . . . . 6 ⊢ (𝑦 ∈ 𝐵 ↦ 𝐷) = (𝑦 ∈ 𝐵 ↦ 𝐷) | |
9 | 8 | fnmpt 6181 | . . . . 5 ⊢ (∀𝑦 ∈ 𝐵 𝐷 ∈ 𝑋 → (𝑦 ∈ 𝐵 ↦ 𝐷) Fn 𝐵) |
10 | 7, 9 | syl 17 | . . . 4 ⊢ (𝜑 → (𝑦 ∈ 𝐵 ↦ 𝐷) Fn 𝐵) |
11 | f1od.4 | . . . . . . 7 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑥 = 𝐷))) | |
12 | 11 | opabbidv 4868 | . . . . . 6 ⊢ (𝜑 → {〈𝑦, 𝑥〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)} = {〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐵 ∧ 𝑥 = 𝐷)}) |
13 | df-mpt 4882 | . . . . . . . . 9 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)} | |
14 | 3, 13 | eqtri 2782 | . . . . . . . 8 ⊢ 𝐹 = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)} |
15 | 14 | cnveqi 5452 | . . . . . . 7 ⊢ ◡𝐹 = ◡{〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)} |
16 | cnvopab 5691 | . . . . . . 7 ⊢ ◡{〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)} = {〈𝑦, 𝑥〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)} | |
17 | 15, 16 | eqtri 2782 | . . . . . 6 ⊢ ◡𝐹 = {〈𝑦, 𝑥〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶)} |
18 | df-mpt 4882 | . . . . . 6 ⊢ (𝑦 ∈ 𝐵 ↦ 𝐷) = {〈𝑦, 𝑥〉 ∣ (𝑦 ∈ 𝐵 ∧ 𝑥 = 𝐷)} | |
19 | 12, 17, 18 | 3eqtr4g 2819 | . . . . 5 ⊢ (𝜑 → ◡𝐹 = (𝑦 ∈ 𝐵 ↦ 𝐷)) |
20 | 19 | fneq1d 6142 | . . . 4 ⊢ (𝜑 → (◡𝐹 Fn 𝐵 ↔ (𝑦 ∈ 𝐵 ↦ 𝐷) Fn 𝐵)) |
21 | 10, 20 | mpbird 247 | . . 3 ⊢ (𝜑 → ◡𝐹 Fn 𝐵) |
22 | dff1o4 6306 | . . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵)) | |
23 | 5, 21, 22 | sylanbrc 701 | . 2 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵) |
24 | 23, 19 | jca 555 | 1 ⊢ (𝜑 → (𝐹:𝐴–1-1-onto→𝐵 ∧ ◡𝐹 = (𝑦 ∈ 𝐵 ↦ 𝐷))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 = wceq 1632 ∈ wcel 2139 ∀wral 3050 {copab 4864 ↦ cmpt 4881 ◡ccnv 5265 Fn wfn 6044 –1-1-onto→wf1o 6048 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-sep 4933 ax-nul 4941 ax-pr 5055 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1074 df-tru 1635 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ral 3055 df-rab 3059 df-v 3342 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-nul 4059 df-if 4231 df-sn 4322 df-pr 4324 df-op 4328 df-br 4805 df-opab 4865 df-mpt 4882 df-id 5174 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 |
This theorem is referenced by: f1od 7050 f1ocnv2d 7051 pw2f1ocnv 38106 |
Copyright terms: Public domain | W3C validator |