Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dff14b | Structured version Visualization version GIF version |
Description: A one-to-one function in terms of different function values for different arguments. (Contributed by Alexander van der Vekens, 26-Jan-2018.) |
Ref | Expression |
---|---|
dff14b | ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐴 ∖ {𝑥})(𝐹‘𝑥) ≠ (𝐹‘𝑦))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dff14a 7028 | . 2 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → (𝐹‘𝑥) ≠ (𝐹‘𝑦)))) | |
2 | necom 3069 | . . . . . . 7 ⊢ (𝑥 ≠ 𝑦 ↔ 𝑦 ≠ 𝑥) | |
3 | 2 | imbi1i 352 | . . . . . 6 ⊢ ((𝑥 ≠ 𝑦 → (𝐹‘𝑥) ≠ (𝐹‘𝑦)) ↔ (𝑦 ≠ 𝑥 → (𝐹‘𝑥) ≠ (𝐹‘𝑦))) |
4 | 3 | ralbii 3165 | . . . . 5 ⊢ (∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → (𝐹‘𝑥) ≠ (𝐹‘𝑦)) ↔ ∀𝑦 ∈ 𝐴 (𝑦 ≠ 𝑥 → (𝐹‘𝑥) ≠ (𝐹‘𝑦))) |
5 | raldifsnb 4729 | . . . . 5 ⊢ (∀𝑦 ∈ 𝐴 (𝑦 ≠ 𝑥 → (𝐹‘𝑥) ≠ (𝐹‘𝑦)) ↔ ∀𝑦 ∈ (𝐴 ∖ {𝑥})(𝐹‘𝑥) ≠ (𝐹‘𝑦)) | |
6 | 4, 5 | bitri 277 | . . . 4 ⊢ (∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → (𝐹‘𝑥) ≠ (𝐹‘𝑦)) ↔ ∀𝑦 ∈ (𝐴 ∖ {𝑥})(𝐹‘𝑥) ≠ (𝐹‘𝑦)) |
7 | 6 | ralbii 3165 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → (𝐹‘𝑥) ≠ (𝐹‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐴 ∖ {𝑥})(𝐹‘𝑥) ≠ (𝐹‘𝑦)) |
8 | 7 | anbi2i 624 | . 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 → (𝐹‘𝑥) ≠ (𝐹‘𝑦))) ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐴 ∖ {𝑥})(𝐹‘𝑥) ≠ (𝐹‘𝑦))) |
9 | 1, 8 | bitri 277 | 1 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝐴 ∖ {𝑥})(𝐹‘𝑥) ≠ (𝐹‘𝑦))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ≠ wne 3016 ∀wral 3138 ∖ cdif 3933 {csn 4567 ⟶wf 6351 –1-1→wf1 6352 ‘cfv 6355 |
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 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
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-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fv 6363 |
This theorem is referenced by: f12dfv 7030 f13dfv 7031 |
Copyright terms: Public domain | W3C validator |