| 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 6665 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐹 ↾ 𝑋) Fn 𝑋) | |
| 2 | 1 | 3adant2 1149 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐹 ↾ 𝑋) Fn 𝑋) |
| 3 | fnssres 6665 | . . . 4 ⊢ ((𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐺 ↾ 𝑋) Fn 𝑋) | |
| 4 | 3 | 3adant1 1148 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → (𝐺 ↾ 𝑋) Fn 𝑋) |
| 5 | fneqeql 7048 | . . 3 ⊢ (((𝐹 ↾ 𝑋) Fn 𝑋 ∧ (𝐺 ↾ 𝑋) Fn 𝑋) → ((𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ↔ dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = 𝑋)) | |
| 6 | 2, 4, 5 | syl2anc 596 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ((𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ↔ dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = 𝑋)) |
| 7 | resindir 6000 | . . . . . 6 ⊢ ((𝐹 ∩ 𝐺) ↾ 𝑋) = ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) | |
| 8 | 7 | dmeqi 5899 | . . . . 5 ⊢ dom ((𝐹 ∩ 𝐺) ↾ 𝑋) = dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) |
| 9 | dmres 6016 | . . . . 5 ⊢ dom ((𝐹 ∩ 𝐺) ↾ 𝑋) = (𝑋 ∩ dom (𝐹 ∩ 𝐺)) | |
| 10 | 8, 9 | eqtr3i 2791 | . . . 4 ⊢ dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = (𝑋 ∩ dom (𝐹 ∩ 𝐺)) |
| 11 | 10 | eqeq1i 2771 | . . 3 ⊢ (dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = 𝑋 ↔ (𝑋 ∩ dom (𝐹 ∩ 𝐺)) = 𝑋) |
| 12 | dfss2 3926 | . . 3 ⊢ (𝑋 ⊆ dom (𝐹 ∩ 𝐺) ↔ (𝑋 ∩ dom (𝐹 ∩ 𝐺)) = 𝑋) | |
| 13 | 11, 12 | bitr4i 281 | . 2 ⊢ (dom ((𝐹 ↾ 𝑋) ∩ (𝐺 ↾ 𝑋)) = 𝑋 ↔ 𝑋 ⊆ dom (𝐹 ∩ 𝐺)) |
| 14 | 6, 13 | bitrdi 290 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴 ∧ 𝑋 ⊆ 𝐴) → ((𝐹 ↾ 𝑋) = (𝐺 ↾ 𝑋) ↔ 𝑋 ⊆ dom (𝐹 ∩ 𝐺))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ w3a 1103 = wceq 1570 ∩ cin 3907 ⊆ wss 3908 dom cdm 5666 ↾ cres 5668 Fn wfn 6538 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-fv 6551 |
| This theorem is used by: lspextmo 21214 evlseu 22271 symgcom2 33435 hauseqcn 34319 |
| Copyright terms: Public domain | W3C validator |