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

Theorem bnj967 33557
Description: Technical lemma for bnj69 33622. 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
bnj967.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj967.3 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
bnj967.10 𝐷 = (ω ∖ {∅})
bnj967.12 𝐶 = 𝑦 ∈ (𝑓𝑚) pred(𝑦, 𝐴, 𝑅)
bnj967.13 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
bnj967.44 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝐶 ∈ V)
Assertion
Ref Expression
bnj967 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → (𝐺‘suc 𝑖) = 𝑦 ∈ (𝐺𝑖) pred(𝑦, 𝐴, 𝑅))
Distinct variable groups:   𝑦,𝑓   𝑦,𝑖   𝑦,𝑛
Allowed substitution hints:   𝜑(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜓(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜒(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐴(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐶(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐷(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝑅(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐺(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝑋(𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)

Proof of Theorem bnj967
StepHypRef Expression
1 bnj967.44 . . . . . . 7 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛)) → 𝐶 ∈ V)
213adant3 1132 . . . . . 6 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → 𝐶 ∈ V)
3 bnj967.3 . . . . . . . . 9 (𝜒 ↔ (𝑛𝐷𝑓 Fn 𝑛𝜑𝜓))
43bnj1235 33416 . . . . . . . 8 (𝜒𝑓 Fn 𝑛)
543ad2ant1 1133 . . . . . . 7 ((𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) → 𝑓 Fn 𝑛)
653ad2ant2 1134 . . . . . 6 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → 𝑓 Fn 𝑛)
7 simp23 1208 . . . . . 6 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → 𝑝 = suc 𝑛)
8 simp3 1138 . . . . . . 7 ((𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛) → suc 𝑖𝑛)
983ad2ant3 1135 . . . . . 6 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → suc 𝑖𝑛)
102, 6, 7, 9bnj951 33387 . . . . 5 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → (𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛 ∧ suc 𝑖𝑛))
11 bnj967.10 . . . . . . . . . 10 𝐷 = (ω ∖ {∅})
1211bnj923 33380 . . . . . . . . 9 (𝑛𝐷𝑛 ∈ ω)
133, 12bnj769 33374 . . . . . . . 8 (𝜒𝑛 ∈ ω)
14133ad2ant1 1133 . . . . . . 7 ((𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) → 𝑛 ∈ ω)
1514, 8bnj240 33311 . . . . . 6 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → (𝑛 ∈ ω ∧ suc 𝑖𝑛))
16 nnord 7810 . . . . . . . 8 (𝑛 ∈ ω → Ord 𝑛)
17 ordtr 6331 . . . . . . . 8 (Ord 𝑛 → Tr 𝑛)
1816, 17syl 17 . . . . . . 7 (𝑛 ∈ ω → Tr 𝑛)
19 trsuc 6404 . . . . . . 7 ((Tr 𝑛 ∧ suc 𝑖𝑛) → 𝑖𝑛)
2018, 19sylan 580 . . . . . 6 ((𝑛 ∈ ω ∧ suc 𝑖𝑛) → 𝑖𝑛)
2115, 20syl 17 . . . . 5 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → 𝑖𝑛)
22 bnj658 33363 . . . . . . 7 ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛 ∧ suc 𝑖𝑛) → (𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛))
2322anim1i 615 . . . . . 6 (((𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛 ∧ suc 𝑖𝑛) ∧ 𝑖𝑛) → ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛) ∧ 𝑖𝑛))
24 df-bnj17 33299 . . . . . 6 ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛𝑖𝑛) ↔ ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛) ∧ 𝑖𝑛))
2523, 24sylibr 233 . . . . 5 (((𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛 ∧ suc 𝑖𝑛) ∧ 𝑖𝑛) → (𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛𝑖𝑛))
2610, 21, 25syl2anc 584 . . . 4 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → (𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛𝑖𝑛))
27 bnj967.13 . . . . 5 𝐺 = (𝑓 ∪ {⟨𝑛, 𝐶⟩})
2827bnj945 33385 . . . 4 ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛𝑖𝑛) → (𝐺𝑖) = (𝑓𝑖))
2926, 28syl 17 . . 3 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → (𝐺𝑖) = (𝑓𝑖))
3027bnj945 33385 . . . 4 ((𝐶 ∈ V ∧ 𝑓 Fn 𝑛𝑝 = suc 𝑛 ∧ suc 𝑖𝑛) → (𝐺‘suc 𝑖) = (𝑓‘suc 𝑖))
3110, 30syl 17 . . 3 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → (𝐺‘suc 𝑖) = (𝑓‘suc 𝑖))
32 3simpb 1149 . . . 4 ((𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛) → (𝑖 ∈ ω ∧ suc 𝑖𝑛))
33323ad2ant3 1135 . . 3 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → (𝑖 ∈ ω ∧ suc 𝑖𝑛))
343bnj1254 33421 . . . . 5 (𝜒𝜓)
35343ad2ant1 1133 . . . 4 ((𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) → 𝜓)
36353ad2ant2 1134 . . 3 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → 𝜓)
3729, 31, 33, 36bnj951 33387 . 2 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → ((𝐺𝑖) = (𝑓𝑖) ∧ (𝐺‘suc 𝑖) = (𝑓‘suc 𝑖) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑛) ∧ 𝜓))
38 bnj967.2 . . 3 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
39 bnj967.12 . . . 4 𝐶 = 𝑦 ∈ (𝑓𝑚) pred(𝑦, 𝐴, 𝑅)
4039, 27bnj958 33552 . . 3 ((𝐺𝑖) = (𝑓𝑖) → ∀𝑦(𝐺𝑖) = (𝑓𝑖))
4138, 40bnj953 33551 . 2 (((𝐺𝑖) = (𝑓𝑖) ∧ (𝐺‘suc 𝑖) = (𝑓‘suc 𝑖) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑛) ∧ 𝜓) → (𝐺‘suc 𝑖) = 𝑦 ∈ (𝐺𝑖) pred(𝑦, 𝐴, 𝑅))
4237, 41syl 17 1 (((𝑅 FrSe 𝐴𝑋𝐴) ∧ (𝜒𝑛 = suc 𝑚𝑝 = suc 𝑛) ∧ (𝑖 ∈ ω ∧ suc 𝑖𝑝 ∧ suc 𝑖𝑛)) → (𝐺‘suc 𝑖) = 𝑦 ∈ (𝐺𝑖) pred(𝑦, 𝐴, 𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  wral 3064  Vcvv 3445  cdif 3907  cun 3908  c0 4282  {csn 4586  cop 4592   ciun 4954  Tr wtr 5222  Ord word 6316  suc csuc 6319   Fn wfn 6491  cfv 6496  ωcom 7802  w-bnj17 33298   predc-bnj14 33300   FrSe w-bnj15 33304
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384  ax-reg 9528
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-tr 5223  df-id 5531  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-res 5645  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-fv 6504  df-om 7803  df-bnj17 33299
This theorem is referenced by:  bnj910  33560
  Copyright terms: Public domain W3C validator