| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1309 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj60 35459. 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.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| bnj1309.1 | ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} |
| Ref | Expression |
|---|---|
| bnj1309 | ⊢ (𝑤 ∈ 𝐵 → ∀𝑥 𝑤 ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bnj1309.1 | . 2 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} | |
| 2 | hbra1 3301 | . . . 4 ⊢ (∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑 → ∀𝑥∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑) | |
| 3 | 2 | bnj1352 35224 | . . 3 ⊢ ((𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑) → ∀𝑥(𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)) |
| 4 | 3 | hbab 2750 | . 2 ⊢ (𝑤 ∈ {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} → ∀𝑥 𝑤 ∈ {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}) |
| 5 | 1, 4 | hbxfreq 2892 | 1 ⊢ (𝑤 ∈ 𝐵 → ∀𝑥 𝑤 ∈ 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 ∀wal 1567 = wceq 1569 ∈ wcel 2142 {cab 2740 ∀wral 3078 ⊆ wss 3904 predc-bnj14 35086 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1572 df-ex 1809 df-nf 1813 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 |
| This theorem is used by: bnj1311 35421 bnj1373 35427 bnj1498 35458 bnj1525 35466 bnj1523 35468 |
| Copyright terms: Public domain | W3C validator |