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 35228
Description: Technical lemma for bnj852 35254. 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 1161 . . . . . . . . 9 (𝜏𝑓 Fn 𝑚)
3 bnj545.5 . . . . . . . . . 10 (𝜎 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝𝑚))
43simp1bi 1161 . . . . . . . . 9 (𝜎𝑚𝐷)
52, 4anim12i 624 . . . . . . . 8 ((𝜏𝜎) → (𝑓 Fn 𝑚𝑚𝐷))
653adant1 1146 . . . . . . 7 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝑓 Fn 𝑚𝑚𝐷))
7 bnj545.2 . . . . . . . . 9 𝐷 = (ω ∖ {∅})
87bnj529 35075 . . . . . . . 8 (𝑚𝐷 → ∅ ∈ 𝑚)
9 fndm 6639 . . . . . . . 8 (𝑓 Fn 𝑚 → dom 𝑓 = 𝑚)
10 eleq2 2858 . . . . . . . . 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 6637 . . . . . 6 ((𝑅 FrSe 𝐴𝜏𝜎) → Fun 𝐺)
1613, 15jca 520 . . . . 5 ((𝑅 FrSe 𝐴𝜏𝜎) → (∅ ∈ dom 𝑓 ∧ Fun 𝐺))
17 bnj545.3 . . . . . 6 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
1817bnj931 35104 . . . . 5 𝑓𝐺
1916, 18jctil 528 . . . 4 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
20 df-3an 1103 . . . . 5 ((∅ ∈ dom 𝑓 ∧ Fun 𝐺𝑓𝐺) ↔ ((∅ ∈ dom 𝑓 ∧ Fun 𝐺) ∧ 𝑓𝐺))
21 3anrot 1115 . . . . 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 6903 . . 3 ((Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓) → (𝐺‘∅) = (𝑓‘∅))
2624, 25syl 18 . 2 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝐺‘∅) = (𝑓‘∅))
271simp2bi 1162 . . 3 (𝜏𝜑′)
28273ad2ant2 1150 . 2 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝜑′)
29 bnj545.1 . . . 4 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
30 eqtr 2789 . . . 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
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101   = wceq 1567  wcel 2149  cdif 3908  cun 3909  wss 3911  c0 4292  {csn 4592  cop 4598   ciun 4958  dom cdm 5662  suc csuc 6363  Fun wfun 6531   Fn wfn 6532  cfv 6537  ωcom 7862   predc-bnj14 35022   FrSe w-bnj15 35026
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-12 2219  ax-ext 2741  ax-sep 5259  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3423  df-v 3463  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5112  df-opab 5176  df-tr 5221  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-res 5674  df-ord 6364  df-on 6365  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545  df-om 7863
This theorem is referenced by:  bnj600  35252  bnj908  35264
  Copyright terms: Public domain W3C validator