Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1034 Structured version   Visualization version   GIF version

Theorem bnj1034 35667
Description: Technical lemma for bnj69 35707. 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.)
Hypotheses
Ref Expression
bnj1034.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj1034.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj1034.3 (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj1034.4 (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
bnj1034.5 (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
bnj1034.7 (𝜁 ↔ (𝑖 ∈ 𝑛 ∧ 𝑧 ∈ (𝑓‘𝑖)))
bnj1034.8 𝐷 = (ω ∖ {∅})
bnj1034.9 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
bnj1034.10 (∃𝑓∃𝑛∃𝑖(𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵)
Assertion
Ref Expression
bnj1034 ((𝜃 ∧ 𝜏) → trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
Distinct variable groups:   𝐴,𝑓,𝑖,𝑛,𝑦   𝑧,𝐴,𝑓,𝑖,𝑛   𝑧,𝐵   𝐷,𝑖   𝑅,𝑓,𝑖,𝑛,𝑦   𝑧,𝑅   𝑓,𝑋,𝑖,𝑛,𝑦   𝑧,𝑋   𝜏,𝑓,𝑖,𝑛,𝑧   𝜃,𝑓,𝑖,𝑛,𝑧   𝜑,𝑖
Allowed substitution hints:   𝜑(𝑦, 𝑧, 𝑓, 𝑛)   𝜓(𝑦, 𝑧, 𝑓, 𝑖, 𝑛)   𝜒(𝑦, 𝑧, 𝑓, 𝑖, 𝑛)   𝜃(𝑦)   𝜏(𝑦)   𝜁(𝑦, 𝑧, 𝑓, 𝑖, 𝑛)   𝐵(𝑦, 𝑓, 𝑖, 𝑛)   𝐷(𝑦, 𝑧, 𝑓, 𝑛)   𝐾(𝑦, 𝑧, 𝑓, 𝑖, 𝑛)

Proof of Theorem bnj1034
StepHypRef Expression
1 bnj1034.1 . 2 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2 bnj1034.2 . 2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3 bnj1034.3 . 2 (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
4 bnj1034.4 . 2 (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
5 bnj1034.5 . 2 (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
6 biid 264 . 2 (𝑧 ∈ trCl(𝑋, 𝐴, 𝑅) ↔ 𝑧 ∈ trCl(𝑋, 𝐴, 𝑅))
7 bnj1034.7 . 2 (𝜁 ↔ (𝑖 ∈ 𝑛 ∧ 𝑧 ∈ (𝑓‘𝑖)))
8 bnj1034.8 . 2 𝐷 = (ω ∖ {∅})
9 bnj1034.9 . 2 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
10 bnj1034.10 . 2 (∃𝑓∃𝑛∃𝑖(𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵)
111, 2, 3, 4, 5, 6, 7, 8, 9, 10bnj1033 35666 1 ((𝜃 ∧ 𝜏) → trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281  {csn 4588  ∪ ciun 4954  suc csuc 6379   Fn wfn 6550  ‘cfv 6555  ωcom 7898   ∧ w-bnj17 35384   predc-bnj14 35386   FrSe w-bnj15 35390   trClc-bnj18 35392   TrFow-bnj19 35394
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-v 3456  df-ss 3901  df-iun 4956  df-fn 6558  df-bnj17 35385  df-bnj18 35393
This theorem is used by:  bnj1052  35672  bnj1030  35684
  Copyright terms: Public domain W3C validator