Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj917 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj69 33287. 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 |
---|---|
bnj917.1 | ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) |
bnj917.2 | ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
bnj917.3 | ⊢ 𝐷 = (ω ∖ {∅}) |
bnj917.4 | ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} |
bnj917.5 | ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) |
Ref | Expression |
---|---|
bnj917 | ⊢ (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj917.1 | . . 3 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) | |
2 | bnj917.2 | . . 3 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
3 | bnj917.3 | . . 3 ⊢ 𝐷 = (ω ∖ {∅}) | |
4 | bnj917.4 | . . 3 ⊢ 𝐵 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} | |
5 | biid 261 | . . 3 ⊢ ((𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) | |
6 | 1, 2, 3, 4, 5 | bnj916 33210 | . 2 ⊢ (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))) |
7 | bnj917.5 | . . . . . 6 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) | |
8 | bnj252 32980 | . . . . . 6 ⊢ ((𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) | |
9 | 7, 8 | bitri 275 | . . . . 5 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))) |
10 | 9 | 3anbi1i 1157 | . . . 4 ⊢ ((𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))) |
11 | bnj253 32981 | . . . 4 ⊢ ((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ((𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))) | |
12 | 10, 11 | bitr4i 278 | . . 3 ⊢ ((𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ (𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))) |
13 | 12 | 3exbii 1852 | . 2 ⊢ (∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖)) ↔ ∃𝑓∃𝑛∃𝑖(𝑛 ∈ 𝐷 ∧ (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))) |
14 | 6, 13 | sylibr 233 | 1 ⊢ (𝑦 ∈ trCl(𝑋, 𝐴, 𝑅) → ∃𝑓∃𝑛∃𝑖(𝜒 ∧ 𝑖 ∈ 𝑛 ∧ 𝑦 ∈ (𝑓‘𝑖))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1087 = wceq 1541 ∃wex 1781 ∈ wcel 2106 {cab 2714 ∀wral 3062 ∃wrex 3071 ∖ cdif 3899 ∅c0 4274 {csn 4578 ∪ ciun 4946 suc csuc 6309 Fn wfn 6479 ‘cfv 6484 ωcom 7785 ∧ w-bnj17 32963 predc-bnj14 32965 trClc-bnj18 32971 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-12 2171 ax-ext 2708 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1544 df-ex 1782 df-nf 1786 df-sb 2068 df-clab 2715 df-cleq 2729 df-clel 2815 df-ral 3063 df-rex 3072 df-v 3444 df-iun 4948 df-fn 6487 df-bnj17 32964 df-bnj18 32972 |
This theorem is referenced by: bnj981 33227 bnj996 33233 |
Copyright terms: Public domain | W3C validator |