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

Theorem bnj1121 35727
Description: Technical lemma for bnj69 35752. 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
bnj1121.1 (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
bnj1121.2 (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
bnj1121.3 (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj1121.4 (𝜁 ↔ (𝑖 ∈ 𝑛 ∧ 𝑧 ∈ (𝑓‘𝑖)))
bnj1121.5 (𝜂 ↔ ((𝑓 ∈ 𝐾 ∧ 𝑖 ∈ dom 𝑓) → (𝑓‘𝑖) ⊆ 𝐵))
bnj1121.6 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → ∀𝑖 ∈ 𝑛 𝜂)
bnj1121.7 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
Assertion
Ref Expression
bnj1121 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵)

Proof of Theorem bnj1121
StepHypRef Expression
1 19.8a 2224 . . . . 5 (𝜒 → ∃𝑛𝜒)
21bnj707 35498 . . . 4 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → ∃𝑛𝜒)
3 bnj1121.3 . . . . 5 (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
4 bnj1121.7 . . . . 5 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
53, 4bnj1083 35720 . . . 4 (𝑓 ∈ 𝐾 ↔ ∃𝑛𝜒)
62, 5sylibr 237 . . 3 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑓 ∈ 𝐾)
7 bnj1121.4 . . . . . 6 (𝜁 ↔ (𝑖 ∈ 𝑛 ∧ 𝑧 ∈ (𝑓‘𝑖)))
87simplbi 502 . . . . 5 (𝜁 → 𝑖 ∈ 𝑛)
98bnj708 35499 . . . 4 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑖 ∈ 𝑛)
103bnj1235 35546 . . . . . 6 (𝜒 → 𝑓 Fn 𝑛)
1110bnj707 35498 . . . . 5 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑓 Fn 𝑛)
1211fndmd 6673 . . . 4 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → dom 𝑓 = 𝑛)
139, 12eleqtrrd 2870 . . 3 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑖 ∈ dom 𝑓)
14 bnj1121.6 . . . . 5 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → ∀𝑖 ∈ 𝑛 𝜂)
1514, 9bnj1294 35559 . . . 4 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝜂)
16 bnj1121.5 . . . 4 (𝜂 ↔ ((𝑓 ∈ 𝐾 ∧ 𝑖 ∈ dom 𝑓) → (𝑓‘𝑖) ⊆ 𝐵))
1715, 16sylib 221 . . 3 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → ((𝑓 ∈ 𝐾 ∧ 𝑖 ∈ dom 𝑓) → (𝑓‘𝑖) ⊆ 𝐵))
186, 13, 17mp2and 712 . 2 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → (𝑓‘𝑖) ⊆ 𝐵)
197simprbi 503 . . 3 (𝜁 → 𝑧 ∈ (𝑓‘𝑖))
2019bnj708 35499 . 2 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ (𝑓‘𝑖))
2118, 20sseldd 3913 1 ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   = wceq 1572  ∃wex 1814   ∈ wcel 2150  {cab 2744  ∀wral 3083  ∃wrex 3093  Vcvv 3453   ⊆ wss 3899  dom cdm 5657   Fn wfn 6560  ‘cfv 6565   ∧ w-bnj17 35429   predc-bnj14 35431   FrSe w-bnj15 35435   TrFow-bnj19 35439
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-12 2219  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1106  df-tru 1575  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ral 3084  df-rex 3094  df-ss 3900  df-fn 6568  df-bnj17 35430
This theorem is used by:  bnj1030  35729
  Copyright terms: Public domain W3C validator