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

Theorem bnj543 32153
 Description: Technical lemma for bnj852 32181. 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
bnj543.1 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj543.2 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖𝑚 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj543.3 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
bnj543.4 (𝜏 ↔ (𝑓 Fn 𝑚𝜑′𝜓′))
bnj543.5 (𝜎 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝𝑚))
Assertion
Ref Expression
bnj543 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝐺 Fn 𝑛)
Distinct variable groups:   𝐴,𝑖,𝑝,𝑦   𝑅,𝑖,𝑝,𝑦   𝑓,𝑖,𝑝,𝑦   𝑖,𝑚,𝑝   𝑝,𝜑′
Allowed substitution hints:   𝜏(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜎(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝐴(𝑥,𝑓,𝑚,𝑛)   𝑅(𝑥,𝑓,𝑚,𝑛)   𝐺(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)   𝜑′(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛)   𝜓′(𝑥,𝑦,𝑓,𝑖,𝑚,𝑛,𝑝)

Proof of Theorem bnj543
StepHypRef Expression
1 bnj257 31965 . . . . . . 7 (((𝜑′𝜓′) ∧ (𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚) ↔ ((𝜑′𝜓′) ∧ (𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑓 Fn 𝑚𝑛 = suc 𝑚))
2 bnj268 31967 . . . . . . 7 (((𝜑′𝜓′) ∧ (𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑓 Fn 𝑚𝑛 = suc 𝑚) ↔ ((𝜑′𝜓′) ∧ 𝑓 Fn 𝑚 ∧ (𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚))
31, 2bitri 277 . . . . . 6 (((𝜑′𝜓′) ∧ (𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚) ↔ ((𝜑′𝜓′) ∧ 𝑓 Fn 𝑚 ∧ (𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚))
4 bnj253 31962 . . . . . 6 (((𝜑′𝜓′) ∧ (𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚) ↔ (((𝜑′𝜓′) ∧ (𝑚 ∈ ω ∧ 𝑝𝑚)) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚))
5 bnj256 31964 . . . . . 6 (((𝜑′𝜓′) ∧ 𝑓 Fn 𝑚 ∧ (𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚) ↔ (((𝜑′𝜓′) ∧ 𝑓 Fn 𝑚) ∧ ((𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚)))
63, 4, 53bitr3i 303 . . . . 5 ((((𝜑′𝜓′) ∧ (𝑚 ∈ ω ∧ 𝑝𝑚)) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚) ↔ (((𝜑′𝜓′) ∧ 𝑓 Fn 𝑚) ∧ ((𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚)))
7 bnj256 31964 . . . . . 6 ((𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ↔ ((𝜑′𝜓′) ∧ (𝑚 ∈ ω ∧ 𝑝𝑚)))
873anbi1i 1151 . . . . 5 (((𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚) ↔ (((𝜑′𝜓′) ∧ (𝑚 ∈ ω ∧ 𝑝𝑚)) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚))
9 bnj543.4 . . . . . . 7 (𝜏 ↔ (𝑓 Fn 𝑚𝜑′𝜓′))
10 bnj170 31956 . . . . . . 7 ((𝑓 Fn 𝑚𝜑′𝜓′) ↔ ((𝜑′𝜓′) ∧ 𝑓 Fn 𝑚))
119, 10bitri 277 . . . . . 6 (𝜏 ↔ ((𝜑′𝜓′) ∧ 𝑓 Fn 𝑚))
12 bnj543.5 . . . . . . 7 (𝜎 ↔ (𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝𝑚))
13 3anan32 1091 . . . . . . 7 ((𝑚 ∈ ω ∧ 𝑛 = suc 𝑚𝑝𝑚) ↔ ((𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚))
1412, 13bitri 277 . . . . . 6 (𝜎 ↔ ((𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚))
1511, 14anbi12i 628 . . . . 5 ((𝜏𝜎) ↔ (((𝜑′𝜓′) ∧ 𝑓 Fn 𝑚) ∧ ((𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚)))
166, 8, 153bitr4ri 306 . . . 4 ((𝜏𝜎) ↔ ((𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚))
1716anbi2i 624 . . 3 ((𝑅 FrSe 𝐴 ∧ (𝜏𝜎)) ↔ (𝑅 FrSe 𝐴 ∧ ((𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚)))
18 3anass 1089 . . 3 ((𝑅 FrSe 𝐴𝜏𝜎) ↔ (𝑅 FrSe 𝐴 ∧ (𝜏𝜎)))
19 bnj252 31961 . . 3 ((𝑅 FrSe 𝐴 ∧ (𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚) ↔ (𝑅 FrSe 𝐴 ∧ ((𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚)))
2017, 18, 193bitr4i 305 . 2 ((𝑅 FrSe 𝐴𝜏𝜎) ↔ (𝑅 FrSe 𝐴 ∧ (𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚))
21 df-suc 6190 . . . . . . 7 suc 𝑚 = (𝑚 ∪ {𝑚})
2221eqeq2i 2832 . . . . . 6 (𝑛 = suc 𝑚𝑛 = (𝑚 ∪ {𝑚}))
23223anbi2i 1152 . . . . 5 (((𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚) ↔ ((𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚))
2423anbi2i 624 . . . 4 ((𝑅 FrSe 𝐴 ∧ ((𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚)) ↔ (𝑅 FrSe 𝐴 ∧ ((𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚)))
25 bnj252 31961 . . . 4 ((𝑅 FrSe 𝐴 ∧ (𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚) ↔ (𝑅 FrSe 𝐴 ∧ ((𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚)))
2624, 19, 253bitr4i 305 . . 3 ((𝑅 FrSe 𝐴 ∧ (𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚) ↔ (𝑅 FrSe 𝐴 ∧ (𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚))
27 bnj543.1 . . . 4 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
28 bnj543.2 . . . 4 (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖𝑚 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
29 bnj543.3 . . . 4 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
30 biid 263 . . . 4 ((𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ↔ (𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚))
3127, 28, 29, 30bnj535 32150 . . 3 ((𝑅 FrSe 𝐴 ∧ (𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = (𝑚 ∪ {𝑚}) ∧ 𝑓 Fn 𝑚) → 𝐺 Fn 𝑛)
3226, 31sylbi 219 . 2 ((𝑅 FrSe 𝐴 ∧ (𝜑′𝜓′𝑚 ∈ ω ∧ 𝑝𝑚) ∧ 𝑛 = suc 𝑚𝑓 Fn 𝑚) → 𝐺 Fn 𝑛)
3320, 32sylbi 219 1 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝐺 Fn 𝑛)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1081   = wceq 1530   ∈ wcel 2107  ∀wral 3136   ∪ cun 3932  ∅c0 4289  {csn 4559  ⟨cop 4565  ∪ ciun 4910  suc csuc 6186   Fn wfn 6343  ‘cfv 6348  ωcom 7572   ∧ w-bnj17 31944   predc-bnj14 31946   FrSe w-bnj15 31950 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pr 5320  ax-un 7453  ax-reg 9048 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1082  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-reu 3143  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-om 7573  df-bnj17 31945  df-bnj14 31947  df-bnj13 31949  df-bnj15 31951 This theorem is referenced by:  bnj544  32154
 Copyright terms: Public domain W3C validator