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 33979
Description: Technical lemma for bnj69 34052. 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 2816 . . 3 (𝑋𝐴 → ∃𝑥 𝑥 = 𝑋)
21bnj706 33796 . 2 ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) → ∃𝑥 𝑥 = 𝑋)
3 bnj291 33753 . . . . . 6 ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) ↔ ((𝑅 FrSe 𝐴𝜏𝜎) ∧ 𝑋𝐴))
43simplbi 499 . . . . 5 ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) → (𝑅 FrSe 𝐴𝜏𝜎))
5 bnj602 33957 . . . . . . . . . 10 (𝑥 = 𝑋 → pred(𝑥, 𝐴, 𝑅) = pred(𝑋, 𝐴, 𝑅))
65eqeq2d 2744 . . . . . . . . 9 (𝑥 = 𝑋 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)))
7 bnj938.4 . . . . . . . . 9 (𝜑′ ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
86, 7bitr4di 289 . . . . . . . 8 (𝑥 = 𝑋 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ 𝜑′))
983anbi2d 1442 . . . . . . 7 (𝑥 = 𝑋 → ((𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ↔ (𝑓 Fn 𝑚𝜑′𝜓′)))
10 bnj938.2 . . . . . . 7 (𝜏 ↔ (𝑓 Fn 𝑚𝜑′𝜓′))
119, 10bitr4di 289 . . . . . 6 (𝑥 = 𝑋 → ((𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ↔ 𝜏))
12113anbi2d 1442 . . . . 5 (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴 ∧ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ∧ 𝜎) ↔ (𝑅 FrSe 𝐴𝜏𝜎)))
134, 12imbitrrid 245 . . . 4 (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) → (𝑅 FrSe 𝐴 ∧ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ∧ 𝜎)))
14 bnj938.1 . . . . 5 𝐷 = (ω ∖ {∅})
15 biid 261 . . . . 5 ((𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ↔ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′))
16 bnj938.3 . . . . 5 (𝜎 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝𝑚))
17 biid 261 . . . . 5 ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
18 bnj938.5 . . . . 5 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖𝑚 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
1914, 15, 16, 17, 18bnj546 33938 . . . 4 ((𝑅 FrSe 𝐴 ∧ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ∧ 𝜎) → 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)
2013, 19syl6 35 . . 3 (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) → 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V))
2120exlimiv 1934 . 2 (∃𝑥 𝑥 = 𝑋 → ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) → 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V))
222, 21mpcom 38 1 ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) → 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  w3a 1088   = wceq 1542  wex 1782  wcel 2107  wral 3062  Vcvv 3475  cdif 3946  c0 4323  {csn 4629   ciun 4998  suc csuc 6367   Fn wfn 6539  cfv 6544  ωcom 7855  w-bnj17 33728   predc-bnj14 33730   FrSe w-bnj15 33734
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-rep 5286  ax-sep 5300  ax-nul 5307  ax-pr 5428  ax-un 7725
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-tr 5267  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fv 6552  df-om 7856  df-bnj17 33729  df-bnj14 33731  df-bnj13 33733  df-bnj15 33735
This theorem is referenced by:  bnj944  33980  bnj969  33988
  Copyright terms: Public domain W3C validator