| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fnreseql | Structured version Visualization version GIF version | ||
| Description: Two functions are equal on a subset iff their equalizer contains that subset. (Contributed by Stefan O'Rear, 7-Mar-2015.) |
| Ref | Expression |
|---|---|
| fnreseql | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ((𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ↔ 𝑋 ⊆ dom (𝐹 ∩ 𝐺))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fnssres 6644 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐹 ↾ 𝑋) Fn 𝑋) | |
| 2 | 1 | 3adant2 1131 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐹 ↾ 𝑋) Fn 𝑋) |
| 3 | fnssres 6644 | . . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐺 ↾ 𝑋) Fn 𝑋) | |
| 4 | 3 | 3adant1 1130 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐺 ↾ 𝑋) Fn 𝑋) |
| 5 | fneqeql 7021 | . . 3 ⊢ (((𝐹 ↾ 𝑋) Fn 𝑋 ∧ (𝐺 ↾ 𝑋) Fn 𝑋) → ((𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ↔ dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = 𝑋)) | |
| 6 | 2, 4, 5 | syl2anc 584 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ((𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ↔ dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = 𝑋)) |
| 7 | resindir 5970 | . . . . . 6 ⊢ ((𝐹 ∩ 𝐺) ↾ 𝑋) = ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) | |
| 8 | 7 | dmeqi 5871 | . . . . 5 ⊢ dom ((𝐹 ∩ 𝐺) ↾ 𝑋) = dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) |
| 9 | dmres 5986 | . . . . 5 ⊢ dom ((𝐹 ∩ 𝐺) ↾ 𝑋) = (𝑋 ∩ dom (𝐹 ∩ 𝐺)) | |
| 10 | 8, 9 | eqtr3i 2755 | . . . 4 ⊢ dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = (𝑋 ∩ dom (𝐹 ∩ 𝐺)) |
| 11 | 10 | eqeq1i 2735 | . . 3 ⊢ (dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = 𝑋 ↔ (𝑋 ∩ dom (𝐹 ∩ 𝐺)) = 𝑋) |
| 12 | dfss2 3935 | . . 3 ⊢ (𝑋 ⊆ dom (𝐹 ∩ 𝐺) ↔ (𝑋 ∩ dom (𝐹 ∩ 𝐺)) = 𝑋) | |
| 13 | 11, 12 | bitr4i 278 | . 2 ⊢ (dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = 𝑋 ↔ 𝑋 ⊆ dom (𝐹 ∩ 𝐺)) |
| 14 | 6, 13 | bitrdi 287 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ((𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ↔ 𝑋 ⊆ dom (𝐹 ∩ 𝐺))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1086 = wceq 1540 ∩ cin 3916 ⊆ wss 3917 dom cdm 5641 ↾ cres 5643 Fn wfn 6509 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-fv 6522 |
| This theorem is referenced by: lspextmo 20970 evlseu 21997 symgcom2 33048 hauseqcn 33895 |
| Copyright terms: Public domain | W3C validator |