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 35192
Description: Technical lemma for bnj852 35218. 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 1159 . . . . . . . . 9 (𝜏𝑓 Fn 𝑚)
3 bnj545.5 . . . . . . . . . 10 (𝜎 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝𝑚))
43simp1bi 1159 . . . . . . . . 9 (𝜎𝑚𝐷)
52, 4anim12i 622 . . . . . . . 8 ((𝜏𝜎) → (𝑓 Fn 𝑚𝑚𝐷))
653adant1 1144 . . . . . . 7 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝑓 Fn 𝑚𝑚𝐷))
7 bnj545.2 . . . . . . . . 9 𝐷 = (ω ∖ {∅})
87bnj529 35039 . . . . . . . 8 (𝑚𝐷 → ∅ ∈ 𝑚)
9 fndm 6626 . . . . . . . 8 (𝑓 Fn 𝑚 → dom 𝑓 = 𝑚)
10 eleq2 2853 . . . . . . . . 9 (dom 𝑓 = 𝑚 → (∅ ∈ dom 𝑓 ↔ ∅ ∈ 𝑚))
1110biimparc 483 . . . . . . . 8 ((∅ ∈ 𝑚 ∧ dom 𝑓 = 𝑚) → ∅ ∈ dom 𝑓)
128, 9, 11syl2anr 606 . . . . . . 7 ((𝑓 Fn 𝑚𝑚𝐷) → ∅ ∈ dom 𝑓)
136, 12syl 17 . . . . . 6 ((𝑅 FrSe 𝐴𝜏𝜎) → ∅ ∈ dom 𝑓)
14 bnj545.6 . . . . . . 7 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝐺 Fn 𝑛)
1514fnfund 6624 . . . . . 6 ((𝑅 FrSe 𝐴𝜏𝜎) → Fun 𝐺)
1613, 15jca 519 . . . . 5 ((𝑅 FrSe 𝐴𝜏𝜎) → (∅ ∈ dom 𝑓 ∧ Fun 𝐺))
17 bnj545.3 . . . . . 6 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
1817bnj931 35068 . . . . 5 𝑓𝐺
1916, 18jctil 527 . . . 4 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
20 df-3an 1101 . . . . 5 ((∅ ∈ dom 𝑓 ∧ Fun 𝐺𝑓𝐺) ↔ ((∅ ∈ dom 𝑓 ∧ Fun 𝐺) ∧ 𝑓𝐺))
21 3anrot 1113 . . . . 5 ((∅ ∈ dom 𝑓 ∧ Fun 𝐺𝑓𝐺) ↔ (Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓))
22 ancom 464 . . . . 5 (((∅ ∈ dom 𝑓 ∧ Fun 𝐺) ∧ 𝑓𝐺) ↔ (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
2320, 21, 223bitr3i 303 . . . 4 ((Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓) ↔ (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
2419, 23sylibr 236 . . 3 ((𝑅 FrSe 𝐴𝜏𝜎) → (Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓))
25 funssfv 6890 . . 3 ((Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓) → (𝐺‘∅) = (𝑓‘∅))
2624, 25syl 17 . 2 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝐺‘∅) = (𝑓‘∅))
271simp2bi 1160 . . 3 (𝜏𝜑′)
28273ad2ant2 1148 . 2 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝜑′)
29 bnj545.1 . . . 4 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
30 eqtr 2784 . . . 4 (((𝐺‘∅) = (𝑓‘∅) ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) → (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
3129, 30sylan2b 603 . . 3 (((𝐺‘∅) = (𝑓‘∅) ∧ 𝜑′) → (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
32 bnj545.7 . . 3 (𝜑″ ↔ (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
3331, 32sylibr 236 . 2 (((𝐺‘∅) = (𝑓‘∅) ∧ 𝜑′) → 𝜑″)
3426, 28, 33syl2anc 593 1 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝜑″)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1099   = wceq 1562  wcel 2144  cdif 3903  cun 3904  wss 3906  c0 4287  {csn 4584  cop 4590   ciun 4951  dom cdm 5649  suc csuc 6350  Fun wfun 6517   Fn wfn 6518  cfv 6523  ωcom 7848   predc-bnj14 34986   FrSe w-bnj15 34990
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-pr 5392
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-opab 5165  df-tr 5210  df-id 5544  df-eprel 5549  df-po 5557  df-so 5558  df-fr 5602  df-we 5604  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-res 5661  df-ord 6351  df-on 6352  df-iota 6479  df-fun 6525  df-fn 6526  df-fv 6531  df-om 7849
This theorem is referenced by:  bnj600  35216  bnj908  35228
  Copyright terms: Public domain W3C validator