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 35292
Description: Technical lemma for bnj852 35318. 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 1162 . . . . . . . . 9 (𝜏𝑓 Fn 𝑚)
3 bnj545.5 . . . . . . . . . 10 (𝜎 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝𝑚))
43simp1bi 1162 . . . . . . . . 9 (𝜎𝑚𝐷)
52, 4anim12i 624 . . . . . . . 8 ((𝜏𝜎) → (𝑓 Fn 𝑚𝑚𝐷))
653adant1 1147 . . . . . . 7 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝑓 Fn 𝑚𝑚𝐷))
7 bnj545.2 . . . . . . . . 9 𝐷 = (ω ∖ {∅})
87bnj529 35139 . . . . . . . 8 (𝑚𝐷 → ∅ ∈ 𝑚)
9 fndm 6638 . . . . . . . 8 (𝑓 Fn 𝑚 → dom 𝑓 = 𝑚)
10 eleq2 2851 . . . . . . . . 9 (dom 𝑓 = 𝑚 → (∅ ∈ dom 𝑓 ↔ ∅ ∈ 𝑚))
1110biimparc 484 . . . . . . . 8 ((∅ ∈ 𝑚 ∧ dom 𝑓 = 𝑚) → ∅ ∈ dom 𝑓)
128, 9, 11syl2anr 608 . . . . . . 7 ((𝑓 Fn 𝑚𝑚𝐷) → ∅ ∈ dom 𝑓)
136, 12syl 18 . . . . . 6 ((𝑅 FrSe 𝐴𝜏𝜎) → ∅ ∈ dom 𝑓)
14 bnj545.6 . . . . . . 7 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝐺 Fn 𝑛)
1514fnfund 6636 . . . . . 6 ((𝑅 FrSe 𝐴𝜏𝜎) → Fun 𝐺)
1613, 15jca 520 . . . . 5 ((𝑅 FrSe 𝐴𝜏𝜎) → (∅ ∈ dom 𝑓 ∧ Fun 𝐺))
17 bnj545.3 . . . . . 6 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
1817bnj931 35168 . . . . 5 𝑓𝐺
1916, 18jctil 528 . . . 4 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
20 df-3an 1104 . . . . 5 ((∅ ∈ dom 𝑓 ∧ Fun 𝐺𝑓𝐺) ↔ ((∅ ∈ dom 𝑓 ∧ Fun 𝐺) ∧ 𝑓𝐺))
21 3anrot 1116 . . . . 5 ((∅ ∈ dom 𝑓 ∧ Fun 𝐺𝑓𝐺) ↔ (Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓))
22 ancom 465 . . . . 5 (((∅ ∈ dom 𝑓 ∧ Fun 𝐺) ∧ 𝑓𝐺) ↔ (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
2320, 21, 223bitr3i 304 . . . 4 ((Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓) ↔ (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
2419, 23sylibr 237 . . 3 ((𝑅 FrSe 𝐴𝜏𝜎) → (Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓))
25 funssfv 6902 . . 3 ((Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓) → (𝐺‘∅) = (𝑓‘∅))
2624, 25syl 18 . 2 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝐺‘∅) = (𝑓‘∅))
271simp2bi 1163 . . 3 (𝜏𝜑′)
28273ad2ant2 1151 . 2 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝜑′)
29 bnj545.1 . . . 4 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
30 eqtr 2782 . . . 4 (((𝐺‘∅) = (𝑓‘∅) ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) → (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
3129, 30sylan2b 605 . . 3 (((𝐺‘∅) = (𝑓‘∅) ∧ 𝜑′) → (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
32 bnj545.7 . . 3 (𝜑″ ↔ (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
3331, 32sylibr 237 . 2 (((𝐺‘∅) = (𝑓‘∅) ∧ 𝜑′) → 𝜑″)
3426, 28, 33syl2anc 595 1 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝜑″)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400  w3a 1102   = wceq 1569  wcel 2142  cdif 3901  cun 3902  wss 3904  c0 4285  {csn 4588  cop 4594   ciun 4955  dom cdm 5660  suc csuc 6362  Fun wfun 6530   Fn wfn 6531  cfv 6536  ωcom 7860   predc-bnj14 35086   FrSe w-bnj15 35090
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-pr 5403
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-res 5672  df-ord 6363  df-on 6364  df-iota 6492  df-fun 6538  df-fn 6539  df-fv 6544  df-om 7861
This theorem is used by:  bnj600  35316  bnj908  35328
  Copyright terms: Public domain W3C validator