![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj564 | Structured version Visualization version GIF version |
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.) |
Ref | Expression |
---|---|
bnj564.17 | ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)) |
Ref | Expression |
---|---|
bnj564 | ⊢ (𝜏 → dom 𝑓 = 𝑚) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj564.17 | . . 3 ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)) | |
2 | 1 | simp1bi 1069 | . 2 ⊢ (𝜏 → 𝑓 Fn 𝑚) |
3 | fndm 5904 | . 2 ⊢ (𝑓 Fn 𝑚 → dom 𝑓 = 𝑚) | |
4 | 2, 3 | syl 17 | 1 ⊢ (𝜏 → dom 𝑓 = 𝑚) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ w3a 1031 = wceq 1475 dom cdm 5038 Fn wfn 5799 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 196 df-an 385 df-3an 1033 df-fn 5807 |
This theorem is referenced by: bnj570 30229 bnj916 30257 |
Copyright terms: Public domain | W3C validator |