| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fnnfpeq0 | Structured version Visualization version GIF version | ||
| Description: A function is the identity iff it moves no points. (Contributed by Stefan O'Rear, 25-Aug-2015.) |
| Ref | Expression |
|---|---|
| fnnfpeq0 | ⊢ (𝐹 Fn 𝐴 → (dom (𝐹 ∖ I ) = ∅ ↔ 𝐹 = ( I ↾ 𝐴))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rabeq0 4338 | . . 3 ⊢ ({𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ 𝑥} = ∅ ↔ ∀𝑥 ∈ 𝐴 ¬ (𝐹‘𝑥) ≠ 𝑥) | |
| 2 | nne 2960 | . . . . 5 ⊢ (¬ (𝐹‘𝑥) ≠ 𝑥 ↔ (𝐹‘𝑥) = 𝑥) | |
| 3 | fvresi 7176 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → (( I ↾ 𝐴)‘𝑥) = 𝑥) | |
| 4 | 3 | eqeq2d 2772 | . . . . . 6 ⊢ (𝑥 ∈ 𝐴 → ((𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥) ↔ (𝐹‘𝑥) = 𝑥)) |
| 5 | 4 | adantl 487 | . . . . 5 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥) ↔ (𝐹‘𝑥) = 𝑥)) |
| 6 | 2, 5 | bitr4id 293 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (¬ (𝐹‘𝑥) ≠ 𝑥 ↔ (𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥))) |
| 7 | 6 | ralbidva 3184 | . . 3 ⊢ (𝐹 Fn 𝐴 → (∀𝑥 ∈ 𝐴 ¬ (𝐹‘𝑥) ≠ 𝑥 ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥))) |
| 8 | 1, 7 | bitrid 286 | . 2 ⊢ (𝐹 Fn 𝐴 → ({𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ 𝑥} = ∅ ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥))) |
| 9 | fndifnfp 7179 | . . 3 ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ∖ I ) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ 𝑥}) | |
| 10 | 9 | eqeq1d 2763 | . 2 ⊢ (𝐹 Fn 𝐴 → (dom (𝐹 ∖ I ) = ∅ ↔ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ 𝑥} = ∅)) |
| 11 | fnresi 6666 | . . 3 ⊢ ( I ↾ 𝐴) Fn 𝐴 | |
| 12 | eqfnfv 7027 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ( I ↾ 𝐴) Fn 𝐴) → (𝐹 = ( I ↾ 𝐴) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥))) | |
| 13 | 11, 12 | mpan2 704 | . 2 ⊢ (𝐹 Fn 𝐴 → (𝐹 = ( I ↾ 𝐴) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥))) |
| 14 | 8, 10, 13 | 3bitr4d 314 | 1 ⊢ (𝐹 Fn 𝐴 → (dom (𝐹 ∖ I ) = ∅ ↔ 𝐹 = ( I ↾ 𝐴))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ≠ wne 2956 ∀wral 3077 {crab 3413 ∖ cdif 3896 ∅c0 4279 I cid 5545 dom cdm 5651 ↾ cres 5653 Fn wfn 6532 ‘cfv 6537 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 |
| This theorem is used by: symggen 19677 m1detdiag 22905 mdetdiaglem 22906 |
| Copyright terms: Public domain | W3C validator |