| 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 34907. 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 34894 | . . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V) | |
| 2 | dmsnopg 6202 | . . 3 ⊢ ( pred(𝑥, 𝐴, 𝑅) ∈ V → dom {〈∅, pred(𝑥, 𝐴, 𝑅)〉} = {∅}) | |
| 3 | 1, 2 | syl 17 | . 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → dom {〈∅, pred(𝑥, 𝐴, 𝑅)〉} = {∅}) |
| 4 | bnj96.1 | . . 3 ⊢ 𝐹 = {〈∅, pred(𝑥, 𝐴, 𝑅)〉} | |
| 5 | 4 | dmeqi 5884 | . 2 ⊢ dom 𝐹 = dom {〈∅, pred(𝑥, 𝐴, 𝑅)〉} |
| 6 | df1o2 8487 | . 2 ⊢ 1o = {∅} | |
| 7 | 3, 5, 6 | 3eqtr4g 2795 | 1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → dom 𝐹 = 1o) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 Vcvv 3459 ∅c0 4308 {csn 4601 〈cop 4607 dom cdm 5654 1oc1o 8473 predc-bnj14 34719 FrSe w-bnj15 34723 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-ral 3052 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-op 4608 df-br 5120 df-dm 5664 df-suc 6358 df-1o 8480 df-bnj13 34722 df-bnj15 34724 |
| This theorem is referenced by: bnj150 34907 |
| Copyright terms: Public domain | W3C validator |