Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nff1 | Structured version Visualization version GIF version |
Description: Bound-variable hypothesis builder for a one-to-one function. (Contributed by NM, 16-May-2004.) |
Ref | Expression |
---|---|
nff1.1 | ⊢ Ⅎ𝑥𝐹 |
nff1.2 | ⊢ Ⅎ𝑥𝐴 |
nff1.3 | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
nff1 | ⊢ Ⅎ𝑥 𝐹:𝐴–1-1→𝐵 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-f1 6346 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹)) | |
2 | nff1.1 | . . . 4 ⊢ Ⅎ𝑥𝐹 | |
3 | nff1.2 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
4 | nff1.3 | . . . 4 ⊢ Ⅎ𝑥𝐵 | |
5 | 2, 3, 4 | nff 6496 | . . 3 ⊢ Ⅎ𝑥 𝐹:𝐴⟶𝐵 |
6 | 2 | nfcnv 5735 | . . . 4 ⊢ Ⅎ𝑥◡𝐹 |
7 | 6 | nffun 6364 | . . 3 ⊢ Ⅎ𝑥Fun ◡𝐹 |
8 | 5, 7 | nfan 1900 | . 2 ⊢ Ⅎ𝑥(𝐹:𝐴⟶𝐵 ∧ Fun ◡𝐹) |
9 | 1, 8 | nfxfr 1853 | 1 ⊢ Ⅎ𝑥 𝐹:𝐴–1-1→𝐵 |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 Ⅎwnf 1784 Ⅎwnfc 2961 ◡ccnv 5540 Fun wfun 6335 ⟶wf 6337 –1-1→wf1 6338 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rab 3147 df-v 3488 df-dif 3927 df-un 3929 df-in 3931 df-ss 3940 df-nul 4280 df-if 4454 df-sn 4554 df-pr 4556 df-op 4560 df-br 5053 df-opab 5115 df-rel 5548 df-cnv 5549 df-co 5550 df-dm 5551 df-rn 5552 df-fun 6343 df-fn 6344 df-f 6345 df-f1 6346 |
This theorem is referenced by: nff1o 6599 iundom2g 9948 |
Copyright terms: Public domain | W3C validator |