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

Theorem bnj938 35567
Description: Technical lemma for bnj69 35640. 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
bnj938.1 𝐷 = (ω ∖ {∅})
bnj938.2 (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
bnj938.3 (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚))
bnj938.4 (𝜑′ ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj938.5 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
Assertion
Ref Expression
bnj938 ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)
Distinct variable groups:   𝐴,𝑖,𝑝,𝑦   𝑅,𝑖,𝑝,𝑦   𝑓,𝑖,𝑝,𝑦   𝑖,𝑚,𝑝
Allowed substitution hints:   𝜏(𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜎(𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝐴(𝑓, 𝑚, 𝑛)   𝐷(𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝑅(𝑓, 𝑚, 𝑛)   𝑋(𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜑′(𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)   𝜓′(𝑦, 𝑓, 𝑖, 𝑚, 𝑛, 𝑝)

Proof of Theorem bnj938
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elisset 2842 . . 3 (𝑋 ∈ 𝐴 → ∃𝑥 𝑥 = 𝑋)
21bnj706 35385 . 2 ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → ∃𝑥 𝑥 = 𝑋)
3 bnj291 35342 . . . . . 6 ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) ↔ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑋 ∈ 𝐴))
43simplbi 502 . . . . 5 ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → (𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎))
5 bnj602 35545 . . . . . . . . . 10 (𝑥 = 𝑋 → pred(𝑥, 𝐴, 𝑅) = pred(𝑋, 𝐴, 𝑅))
65eqeq2d 2771 . . . . . . . . 9 (𝑥 = 𝑋 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)))
7 bnj938.4 . . . . . . . . 9 (𝜑′ ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
86, 7bitr4di 292 . . . . . . . 8 (𝑥 = 𝑋 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ 𝜑′))
983anbi2d 1469 . . . . . . 7 (𝑥 = 𝑋 → ((𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)))
10 bnj938.2 . . . . . . 7 (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))
119, 10bitr4di 292 . . . . . 6 (𝑥 = 𝑋 → ((𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ↔ 𝜏))
12113anbi2d 1469 . . . . 5 (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴 ∧ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ∧ 𝜎) ↔ (𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎)))
134, 12imbitrrid 249 . . . 4 (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → (𝑅 FrSe 𝐴 ∧ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ∧ 𝜎)))
14 bnj938.1 . . . . 5 𝐷 = (ω ∖ {∅})
15 biid 264 . . . . 5 ((𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ↔ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′))
16 bnj938.3 . . . . 5 (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚))
17 biid 264 . . . . 5 ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
18 bnj938.5 . . . . 5 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
1914, 15, 16, 17, 18bnj546 35526 . . . 4 ((𝑅 FrSe 𝐴 ∧ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ∧ 𝜎) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)
2013, 19syl6 36 . . 3 (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V))
2120exlimiv 1962 . 2 (∃𝑥 𝑥 = 𝑋 → ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V))
222, 21mpcom 39 1 ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∀wral 3076  Vcvv 3450   ∖ cdif 4045  ∅c0 4278  {csn 4583  ∪ ciun 4950  suc csuc 6364   Fn wfn 6533  ‘cfv 6538  ωcom 7877   ∧ w-bnj17 35317   predc-bnj14 35319   FrSe w-bnj15 35323
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-mo 2564  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-tr 5212  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fv 6546  df-om 7878  df-bnj17 35318  df-bnj14 35320  df-bnj13 35322  df-bnj15 35324
This theorem is used by:  bnj944  35568  bnj969  35576
  Copyright terms: Public domain W3C validator