Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ndmovcl | Structured version Visualization version GIF version |
Description: The closure of an operation outside its domain, when the domain includes the empty set. This technical lemma can make the operation more convenient to work in some cases. It is dependent on our particular definitions of operation value, function value, and ordered pair. (Contributed by NM, 24-Sep-2004.) |
Ref | Expression |
---|---|
ndmov.1 | ⊢ dom 𝐹 = (𝑆 × 𝑆) |
ndmovcl.2 | ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝐹𝐵) ∈ 𝑆) |
ndmovcl.3 | ⊢ ∅ ∈ 𝑆 |
Ref | Expression |
---|---|
ndmovcl | ⊢ (𝐴𝐹𝐵) ∈ 𝑆 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ndmovcl.2 | . 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝐹𝐵) ∈ 𝑆) | |
2 | ndmov.1 | . . . 4 ⊢ dom 𝐹 = (𝑆 × 𝑆) | |
3 | 2 | ndmov 7334 | . . 3 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝐹𝐵) = ∅) |
4 | ndmovcl.3 | . . 3 ⊢ ∅ ∈ 𝑆 | |
5 | 3, 4 | eqeltrdi 2923 | . 2 ⊢ (¬ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴𝐹𝐵) ∈ 𝑆) |
6 | 1, 5 | pm2.61i 184 | 1 ⊢ (𝐴𝐹𝐵) ∈ 𝑆 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∅c0 4293 × cxp 5555 dom cdm 5557 (class class class)co 7158 |
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 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 |
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 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-xp 5563 df-dm 5567 df-iota 6316 df-fv 6365 df-ov 7161 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |