| 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 6615 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐹 ↾ 𝑋) Fn 𝑋) | |
| 2 | 1 | 3adant2 1131 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐹 ↾ 𝑋) Fn 𝑋) |
| 3 | fnssres 6615 | . . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐺 ↾ 𝑋) Fn 𝑋) | |
| 4 | 3 | 3adant1 1130 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐺 ↾ 𝑋) Fn 𝑋) |
| 5 | fneqeql 6991 | . . 3 ⊢ (((𝐹 ↾ 𝑋) Fn 𝑋 ∧ (𝐺 ↾ 𝑋) Fn 𝑋) → ((𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ↔ dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = 𝑋)) | |
| 6 | 2, 4, 5 | syl2anc 584 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ((𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ↔ dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = 𝑋)) |
| 7 | resindir 5955 | . . . . . 6 ⊢ ((𝐹 ∩ 𝐺) ↾ 𝑋) = ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) | |
| 8 | 7 | dmeqi 5853 | . . . . 5 ⊢ dom ((𝐹 ∩ 𝐺) ↾ 𝑋) = dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) |
| 9 | dmres 5971 | . . . . 5 ⊢ dom ((𝐹 ∩ 𝐺) ↾ 𝑋) = (𝑋 ∩ dom (𝐹 ∩ 𝐺)) | |
| 10 | 8, 9 | eqtr3i 2761 | . . . 4 ⊢ dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = (𝑋 ∩ dom (𝐹 ∩ 𝐺)) |
| 11 | 10 | eqeq1i 2741 | . . 3 ⊢ (dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = 𝑋 ↔ (𝑋 ∩ dom (𝐹 ∩ 𝐺)) = 𝑋) |
| 12 | dfss2 3919 | . . 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 1541 ∩ cin 3900 ⊆ wss 3901 dom cdm 5624 ↾ cres 5626 Fn wfn 6487 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-fv 6500 |
| This theorem is referenced by: lspextmo 21008 evlseu 22038 symgcom2 33166 hauseqcn 34055 |
| Copyright terms: Public domain | W3C validator |