Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj96 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj150 32856. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (Revised by Mario Carneiro, 6-May-2015.) (New usage is discouraged.) |
Ref | Expression |
---|---|
bnj96.1 | ⊢ 𝐹 = {〈∅, pred(𝑥, 𝐴, 𝑅)〉} |
Ref | Expression |
---|---|
bnj96 | ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → dom 𝐹 = 1o) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj93 32843 | . . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V) | |
2 | dmsnopg 6116 | . . 3 ⊢ ( pred(𝑥, 𝐴, 𝑅) ∈ V → dom {〈∅, pred(𝑥, 𝐴, 𝑅)〉} = {∅}) | |
3 | 1, 2 | syl 17 | . 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → dom {〈∅, pred(𝑥, 𝐴, 𝑅)〉} = {∅}) |
4 | bnj96.1 | . . 3 ⊢ 𝐹 = {〈∅, pred(𝑥, 𝐴, 𝑅)〉} | |
5 | 4 | dmeqi 5813 | . 2 ⊢ dom 𝐹 = dom {〈∅, pred(𝑥, 𝐴, 𝑅)〉} |
6 | df1o2 8304 | . 2 ⊢ 1o = {∅} | |
7 | 3, 5, 6 | 3eqtr4g 2803 | 1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → dom 𝐹 = 1o) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ∅c0 4256 {csn 4561 〈cop 4567 dom cdm 5589 1oc1o 8290 predc-bnj14 32667 FrSe w-bnj15 32671 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ral 3069 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 df-dm 5599 df-suc 6272 df-1o 8297 df-bnj13 32670 df-bnj15 32672 |
This theorem is referenced by: bnj150 32856 |
Copyright terms: Public domain | W3C validator |