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 35037
Description: Technical lemma for bnj852 35063. 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 1146 . . . . . . . . 9 (𝜏𝑓 Fn 𝑚)
3 bnj545.5 . . . . . . . . . 10 (𝜎 ↔ (𝑚𝐷𝑛 = suc 𝑚𝑝𝑚))
43simp1bi 1146 . . . . . . . . 9 (𝜎𝑚𝐷)
52, 4anim12i 614 . . . . . . . 8 ((𝜏𝜎) → (𝑓 Fn 𝑚𝑚𝐷))
653adant1 1131 . . . . . . 7 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝑓 Fn 𝑚𝑚𝐷))
7 bnj545.2 . . . . . . . . 9 𝐷 = (ω ∖ {∅})
87bnj529 34884 . . . . . . . 8 (𝑚𝐷 → ∅ ∈ 𝑚)
9 fndm 6601 . . . . . . . 8 (𝑓 Fn 𝑚 → dom 𝑓 = 𝑚)
10 eleq2 2825 . . . . . . . . 9 (dom 𝑓 = 𝑚 → (∅ ∈ dom 𝑓 ↔ ∅ ∈ 𝑚))
1110biimparc 479 . . . . . . . 8 ((∅ ∈ 𝑚 ∧ dom 𝑓 = 𝑚) → ∅ ∈ dom 𝑓)
128, 9, 11syl2anr 598 . . . . . . 7 ((𝑓 Fn 𝑚𝑚𝐷) → ∅ ∈ dom 𝑓)
136, 12syl 17 . . . . . 6 ((𝑅 FrSe 𝐴𝜏𝜎) → ∅ ∈ dom 𝑓)
14 bnj545.6 . . . . . . 7 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝐺 Fn 𝑛)
1514fnfund 6599 . . . . . 6 ((𝑅 FrSe 𝐴𝜏𝜎) → Fun 𝐺)
1613, 15jca 511 . . . . 5 ((𝑅 FrSe 𝐴𝜏𝜎) → (∅ ∈ dom 𝑓 ∧ Fun 𝐺))
17 bnj545.3 . . . . . 6 𝐺 = (𝑓 ∪ {⟨𝑚, 𝑦 ∈ (𝑓𝑝) pred(𝑦, 𝐴, 𝑅)⟩})
1817bnj931 34913 . . . . 5 𝑓𝐺
1916, 18jctil 519 . . . 4 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
20 df-3an 1089 . . . . 5 ((∅ ∈ dom 𝑓 ∧ Fun 𝐺𝑓𝐺) ↔ ((∅ ∈ dom 𝑓 ∧ Fun 𝐺) ∧ 𝑓𝐺))
21 3anrot 1100 . . . . 5 ((∅ ∈ dom 𝑓 ∧ Fun 𝐺𝑓𝐺) ↔ (Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓))
22 ancom 460 . . . . 5 (((∅ ∈ dom 𝑓 ∧ Fun 𝐺) ∧ 𝑓𝐺) ↔ (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
2320, 21, 223bitr3i 301 . . . 4 ((Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓) ↔ (𝑓𝐺 ∧ (∅ ∈ dom 𝑓 ∧ Fun 𝐺)))
2419, 23sylibr 234 . . 3 ((𝑅 FrSe 𝐴𝜏𝜎) → (Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓))
25 funssfv 6861 . . 3 ((Fun 𝐺𝑓𝐺 ∧ ∅ ∈ dom 𝑓) → (𝐺‘∅) = (𝑓‘∅))
2624, 25syl 17 . 2 ((𝑅 FrSe 𝐴𝜏𝜎) → (𝐺‘∅) = (𝑓‘∅))
271simp2bi 1147 . . 3 (𝜏𝜑′)
28273ad2ant2 1135 . 2 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝜑′)
29 bnj545.1 . . . 4 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
30 eqtr 2756 . . . 4 (((𝐺‘∅) = (𝑓‘∅) ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) → (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
3129, 30sylan2b 595 . . 3 (((𝐺‘∅) = (𝑓‘∅) ∧ 𝜑′) → (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
32 bnj545.7 . . 3 (𝜑″ ↔ (𝐺‘∅) = pred(𝑥, 𝐴, 𝑅))
3331, 32sylibr 234 . 2 (((𝐺‘∅) = (𝑓‘∅) ∧ 𝜑′) → 𝜑″)
3426, 28, 33syl2anc 585 1 ((𝑅 FrSe 𝐴𝜏𝜎) → 𝜑″)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  cdif 3886  cun 3887  wss 3889  c0 4273  {csn 4567  cop 4573   ciun 4933  dom cdm 5631  suc csuc 6325  Fun wfun 6492   Fn wfn 6493  cfv 6498  ωcom 7817   predc-bnj14 34831   FrSe w-bnj15 34835
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-res 5643  df-ord 6326  df-on 6327  df-iota 6454  df-fun 6500  df-fn 6501  df-fv 6506  df-om 7818
This theorem is referenced by:  bnj600  35061  bnj908  35073
  Copyright terms: Public domain W3C validator