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 32653
Description: Technical lemma for bnj69 32726. 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 2820 . . 3 (𝑋𝐴 → ∃𝑥 𝑥 = 𝑋)
21bnj706 32470 . 2 ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) → ∃𝑥 𝑥 = 𝑋)
3 bnj291 32426 . . . . . 6 ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) ↔ ((𝑅 FrSe 𝐴𝜏𝜎) ∧ 𝑋𝐴))
43simplbi 501 . . . . 5 ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) → (𝑅 FrSe 𝐴𝜏𝜎))
5 bnj602 32631 . . . . . . . . . 10 (𝑥 = 𝑋 → pred(𝑥, 𝐴, 𝑅) = pred(𝑋, 𝐴, 𝑅))
65eqeq2d 2749 . . . . . . . . 9 (𝑥 = 𝑋 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)))
7 bnj938.4 . . . . . . . . 9 (𝜑′ ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
86, 7bitr4di 292 . . . . . . . 8 (𝑥 = 𝑋 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ 𝜑′))
983anbi2d 1443 . . . . . . 7 (𝑥 = 𝑋 → ((𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ↔ (𝑓 Fn 𝑚𝜑′𝜓′)))
10 bnj938.2 . . . . . . 7 (𝜏 ↔ (𝑓 Fn 𝑚𝜑′𝜓′))
119, 10bitr4di 292 . . . . . 6 (𝑥 = 𝑋 → ((𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ↔ 𝜏))
12113anbi2d 1443 . . . . 5 (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴 ∧ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ∧ 𝜎) ↔ (𝑅 FrSe 𝐴𝜏𝜎)))
134, 12syl5ibr 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 32612 . . . 4 ((𝑅 FrSe 𝐴 ∧ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ∧ 𝜎) → 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)
2013, 19syl6 35 . . 3 (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) → 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V))
2120exlimiv 1938 . 2 (∃𝑥 𝑥 = 𝑋 → ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) → 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V))
222, 21mpcom 38 1 ((𝑅 FrSe 𝐴𝑋𝐴𝜏𝜎) → 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  w3a 1089   = wceq 1543  wex 1787  wcel 2111  wral 3062  Vcvv 3420  cdif 3877  c0 4251  {csn 4555   ciun 4918  suc csuc 6232   Fn wfn 6392  cfv 6397  ωcom 7662  w-bnj17 32401   predc-bnj14 32403   FrSe w-bnj15 32407
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2159  ax-12 2176  ax-ext 2709  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pr 5336  ax-un 7541
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2072  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2887  df-ne 2942  df-ral 3067  df-rex 3068  df-reu 3069  df-rab 3071  df-v 3422  df-sbc 3709  df-csb 3826  df-dif 3883  df-un 3885  df-in 3887  df-ss 3897  df-pss 3899  df-nul 4252  df-if 4454  df-pw 4529  df-sn 4556  df-pr 4558  df-tp 4560  df-op 4562  df-uni 4834  df-iun 4920  df-br 5068  df-opab 5130  df-mpt 5150  df-tr 5176  df-id 5469  df-eprel 5474  df-po 5482  df-so 5483  df-fr 5523  df-we 5525  df-xp 5571  df-rel 5572  df-cnv 5573  df-co 5574  df-dm 5575  df-rn 5576  df-res 5577  df-ima 5578  df-ord 6233  df-on 6234  df-lim 6235  df-suc 6236  df-iota 6355  df-fun 6399  df-fn 6400  df-f 6401  df-f1 6402  df-fo 6403  df-f1o 6404  df-fv 6405  df-om 7663  df-bnj17 32402  df-bnj14 32404  df-bnj13 32406  df-bnj15 32408
This theorem is referenced by:  bnj944  32654  bnj969  32662
  Copyright terms: Public domain W3C validator