![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1053 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj69 33679. 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 |
---|---|
bnj1053.1 | ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) |
bnj1053.2 | ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
bnj1053.3 | ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) |
bnj1053.4 | ⊢ (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴)) |
bnj1053.5 | ⊢ (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)) |
bnj1053.6 | ⊢ (𝜁 ↔ (𝑖 ∈ 𝑛 ∧ 𝑧 ∈ (𝑓‘𝑖))) |
bnj1053.7 | ⊢ 𝐷 = (ω ∖ {∅}) |
bnj1053.8 | ⊢ 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} |
bnj1053.9 | ⊢ (𝜂 ↔ ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵)) |
bnj1053.10 | ⊢ (𝜌 ↔ ∀𝑗 ∈ 𝑛 (𝑗 E 𝑖 → [𝑗 / 𝑖]𝜂)) |
bnj1053.37 | ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → ∀𝑖 ∈ 𝑛 (𝜌 → 𝜂)) |
Ref | Expression |
---|---|
bnj1053 | ⊢ ((𝜃 ∧ 𝜏) → trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1053.1 | . 2 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) | |
2 | bnj1053.2 | . 2 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
3 | bnj1053.3 | . 2 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) | |
4 | bnj1053.4 | . 2 ⊢ (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴)) | |
5 | bnj1053.5 | . 2 ⊢ (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵)) | |
6 | bnj1053.6 | . 2 ⊢ (𝜁 ↔ (𝑖 ∈ 𝑛 ∧ 𝑧 ∈ (𝑓‘𝑖))) | |
7 | bnj1053.7 | . 2 ⊢ 𝐷 = (ω ∖ {∅}) | |
8 | bnj1053.8 | . 2 ⊢ 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)} | |
9 | bnj1053.9 | . 2 ⊢ (𝜂 ↔ ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵)) | |
10 | bnj1053.10 | . 2 ⊢ (𝜌 ↔ ∀𝑗 ∈ 𝑛 (𝑗 E 𝑖 → [𝑗 / 𝑖]𝜂)) | |
11 | 7 | bnj923 33437 | . . . . . 6 ⊢ (𝑛 ∈ 𝐷 → 𝑛 ∈ ω) |
12 | nnord 7811 | . . . . . 6 ⊢ (𝑛 ∈ ω → Ord 𝑛) | |
13 | ordfr 6333 | . . . . . 6 ⊢ (Ord 𝑛 → E Fr 𝑛) | |
14 | 11, 12, 13 | 3syl 18 | . . . . 5 ⊢ (𝑛 ∈ 𝐷 → E Fr 𝑛) |
15 | 3, 14 | bnj769 33431 | . . . 4 ⊢ (𝜒 → E Fr 𝑛) |
16 | 15 | bnj707 33424 | . . 3 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → E Fr 𝑛) |
17 | bnj1053.37 | . . 3 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → ∀𝑖 ∈ 𝑛 (𝜌 → 𝜂)) | |
18 | 16, 17 | jca 513 | . 2 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → ( E Fr 𝑛 ∧ ∀𝑖 ∈ 𝑛 (𝜌 → 𝜂))) |
19 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 18 | bnj1052 33644 | 1 ⊢ ((𝜃 ∧ 𝜏) → trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 {cab 2710 ∀wral 3061 ∃wrex 3070 Vcvv 3444 [wsbc 3740 ∖ cdif 3908 ⊆ wss 3911 ∅c0 4283 {csn 4587 ∪ ciun 4955 class class class wbr 5106 E cep 5537 Fr wfr 5586 Ord word 6317 suc csuc 6320 Fn wfn 6492 ‘cfv 6497 ωcom 7803 ∧ w-bnj17 33355 predc-bnj14 33357 FrSe w-bnj15 33361 trClc-bnj18 33363 TrFow-bnj19 33365 |
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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5257 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2941 df-ral 3062 df-rex 3071 df-rab 3407 df-v 3446 df-sbc 3741 df-csb 3857 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4284 df-if 4488 df-pw 4563 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4867 df-iun 4957 df-br 5107 df-tr 5224 df-po 5546 df-so 5547 df-fr 5589 df-we 5591 df-ord 6321 df-on 6322 df-fn 6500 df-om 7804 df-bnj17 33356 df-bnj18 33364 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |