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

Theorem bnj545 35092
Description: Technical lemma for bnj852 35118. 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
bnj545.1 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj545.2 𝐷 = (ω ∖ {∅})
bnj545.3 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
bnj545.4 (𝜏 ↔ (𝑓 Fn 𝑚𝜑′𝜓′))
bnj545.5 (𝜎 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝𝑚))
bnj545.6 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝐺 Fn 𝑛)
bnj545.7 (𝜑″ ↔ (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
Assertion
Ref Expression
bnj545 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝜑″)

Proof of Theorem bnj545
StepHypRef Expression
1 bnj545.4 . . . . . . . . . 10 (𝜏 ↔ (𝑓 Fn 𝑚𝜑′𝜓′))
21simp1bi 1152 . . . . . . . . 9 (𝜏𝑓 Fn 𝑚)
3 bnj545.5 . . . . . . . . . 10 (𝜎 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝𝑚))
43simp1bi 1152 . . . . . . . . 9 (𝜎𝑚𝐷)
52, 4anim12i 620 . . . . . . . 8 ((𝜏𝜎) → (𝑓 Fn 𝑚𝑚𝐷))
653adant1 1137 . . . . . . 7 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝑓 Fn 𝑚𝑚𝐷))
7 bnj545.2 . . . . . . . . 9 𝐷 = (ω ∖ {∅})
87bnj529 34939 . . . . . . . 8 (𝑚𝐷 → ∅ ∈ 𝑚)
9 fndm 6592 . . . . . . . 8 (𝑓 Fn 𝑚 → dom 𝑓 = 𝑚)
10 eleq2 2830 . . . . . . . . 9 (dom 𝑓 = 𝑚 → (∅ ∈ dom 𝑓 ↔ ∅ ∈ 𝑚))
1110biimparc 481 . . . . . . . 8 ((∅ ∈ 𝑚 ∧ dom 𝑓 = 𝑚) → ∅ ∈ dom 𝑓)
128, 9, 11syl2anr 604 . . . . . . 7 ((𝑓 Fn 𝑚𝑚𝐷) → ∅ ∈ dom 𝑓)
136, 12syl 17 . . . . . 6 ((𝑅 FrSe 𝐴𝜏𝜎) → ∅ ∈ dom 𝑓)
14 bnj545.6 . . . . . . 7 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝐺 Fn 𝑛)
1514fnfund 6590 . . . . . 6 ((𝑅 FrSe 𝐴𝜏𝜎) → Fun 𝐺)
1613, 15jca 517 . . . . 5 ((𝑅 FrSe 𝐴𝜏𝜎) → (∅ ∈ dom 𝑓 ∧ Fun 𝐺))
17 bnj545.3 . . . . . 6 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
1817bnj931 34968 . . . . 5 𝑓𝐺
1916, 18jctil 525 . . . 4 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
20 df-3an 1095 . . . . 5 ((∅ ∈ dom 𝑓 ∧ Fun 𝐺𝑓𝐺) ↔ ((∅ ∈ dom 𝑓 ∧ Fun 𝐺) ∧ 𝑓𝐺))
21 3anrot 1106 . . . . 5 ((∅ ∈ dom 𝑓 ∧ Fun 𝐺𝑓𝐺) ↔ (Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓))
22 ancom 462 . . . . 5 (((∅ ∈ dom 𝑓 ∧ Fun 𝐺) ∧ 𝑓𝐺) ↔ (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
2320, 21, 223bitr3i 303 . . . 4 ((Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓) ↔ (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
2419, 23sylibr 236 . . 3 ((𝑅 FrSe 𝐴𝜏𝜎) → (Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓))
25 funssfv 6852 . . 3 ((Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓) → (𝐺‘∅) = (𝑓‘∅))
2624, 25syl 17 . 2 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝐺‘∅) = (𝑓‘∅))
271simp2bi 1153 . . 3 (𝜏𝜑′)
28273ad2ant2 1141 . 2 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝜑′)
29 bnj545.1 . . . 4 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
30 eqtr 2761 . . . 4 (((𝐺‘∅) = (𝑓‘∅) ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) → (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
3129, 30sylan2b 601 . . 3 (((𝐺‘∅) = (𝑓‘∅) ∧ 𝜑′) → (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
32 bnj545.7 . . 3 (𝜑″ ↔ (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
3331, 32sylibr 236 . 2 (((𝐺‘∅) = (𝑓‘∅) ∧ 𝜑′) → 𝜑″)
3426, 28, 33syl2anc 591 1 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝜑″)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397  w3a 1093   = wceq 1548  wcel 2121  cdif 3882  cun 3883  wss 3885  c0 4264  {csn 4558  cop 4564   ciun 4924  dom cdm 5621  suc csuc 6316  Fun wfun 6483   Fn wfn 6484  cfv 6489  ωcom 7810   predc-bnj14 34886   FrSe w-bnj15 34890
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 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-pr 5365
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-opab 5138  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-res 5633  df-ord 6317  df-on 6318  df-iota 6445  df-fun 6491  df-fn 6492  df-fv 6497  df-om 7811
This theorem is referenced by:  bnj600  35116  bnj908  35128
  Copyright terms: Public domain W3C validator