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

Theorem bnj149 35064
Description: Technical lemma for bnj151 35066. 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.) (Proof shortened by Mario Carneiro, 22-Dec-2016.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj149.1 (𝜃1 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃*𝑓(𝑓 Fn 1o𝜑′𝜓′)))
bnj149.2 (𝜁0 ↔ (𝑓 Fn 1o𝜑′𝜓′))
bnj149.3 (𝜁1[𝑔 / 𝑓]𝜁0)
bnj149.4 (𝜑1[𝑔 / 𝑓]𝜑′)
bnj149.5 (𝜓1[𝑔 / 𝑓]𝜓′)
bnj149.6 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
Assertion
Ref Expression
bnj149 𝜃1
Distinct variable groups:   𝐴,𝑓,𝑔,𝑥   𝑅,𝑓,𝑔,𝑥   𝑓,𝜁1   𝑔,𝜁0
Allowed substitution hints:   𝜑′(𝑥,𝑓,𝑔)   𝜓′(𝑥,𝑓,𝑔)   𝜁0(𝑥,𝑓)   𝜑1(𝑥,𝑓,𝑔)   𝜓1(𝑥,𝑓,𝑔)   𝜃1(𝑥,𝑓,𝑔)   𝜁1(𝑥,𝑔)

Proof of Theorem bnj149
StepHypRef Expression
1 simpr1 1201 . . . . . . . 8 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1o𝜑′𝜓′)) → 𝑓 Fn 1o)
2 df1o2 8409 . . . . . . . . 9 1o = {∅}
32fneq2i 6590 . . . . . . . 8 (𝑓 Fn 1o𝑓 Fn {∅})
41, 3sylib 219 . . . . . . 7 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1o𝜑′𝜓′)) → 𝑓 Fn {∅})
5 simpr2 1202 . . . . . . . . . 10 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1o𝜑′𝜓′)) → 𝜑′)
6 bnj149.6 . . . . . . . . . 10 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
75, 6sylib 219 . . . . . . . . 9 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1o𝜑′𝜓′)) → (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
8 fvex 6847 . . . . . . . . . 10 (𝑓‘∅) ∈ V
98elsn 4577 . . . . . . . . 9 ((𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
107, 9sylibr 235 . . . . . . . 8 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1o𝜑′𝜓′)) → (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
11 0ex 5236 . . . . . . . . 9 ∅ ∈ V
12 fveq2 6834 . . . . . . . . . 10 (𝑔 = ∅ → (𝑓𝑔) = (𝑓‘∅))
1312eleq1d 2825 . . . . . . . . 9 (𝑔 = ∅ → ((𝑓𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)}))
1411, 13ralsn 4620 . . . . . . . 8 (∀𝑔 ∈ {∅} (𝑓𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
1510, 14sylibr 235 . . . . . . 7 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1o𝜑′𝜓′)) → ∀𝑔 ∈ {∅} (𝑓𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)})
16 ffnfv 7067 . . . . . . 7 (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓 Fn {∅} ∧ ∀𝑔 ∈ {∅} (𝑓𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)}))
174, 15, 16sylanbrc 589 . . . . . 6 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1o𝜑′𝜓′)) → 𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)})
18 bnj93 35052 . . . . . . . 8 ((𝑅 FrSe 𝐴𝑥𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V)
1918adantr 481 . . . . . . 7 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1o𝜑′𝜓′)) → pred(𝑥, 𝐴, 𝑅) ∈ V)
20 fsng 7086 . . . . . . 7 ((∅ ∈ V ∧ pred(𝑥, 𝐴, 𝑅) ∈ V) → (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
2111, 19, 20sylancr 593 . . . . . 6 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1o𝜑′𝜓′)) → (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
2217, 21mpbid 233 . . . . 5 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1o𝜑′𝜓′)) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩})
2322ex 413 . . . 4 ((𝑅 FrSe 𝐴𝑥𝐴) → ((𝑓 Fn 1o𝜑′𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
2423alrimiv 1934 . . 3 ((𝑅 FrSe 𝐴𝑥𝐴) → ∀𝑓((𝑓 Fn 1o𝜑′𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
25 mo2icl 3662 . . 3 (∀𝑓((𝑓 Fn 1o𝜑′𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}) → ∃*𝑓(𝑓 Fn 1o𝜑′𝜓′))
2624, 25syl 17 . 2 ((𝑅 FrSe 𝐴𝑥𝐴) → ∃*𝑓(𝑓 Fn 1o𝜑′𝜓′))
27 bnj149.1 . 2 (𝜃1 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃*𝑓(𝑓 Fn 1o𝜑′𝜓′)))
2826, 27mpbir 232 1 𝜃1
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1092  wal 1545   = wceq 1547  wcel 2119  ∃*wmo 2541  wral 3054  Vcvv 3432  [wsbc 3730  c0 4268  {csn 4562  cop 4568   Fn wfn 6487  wf 6488  cfv 6492  1oc1o 8395   predc-bnj14 34878   FrSe w-bnj15 34882
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-reu 3346  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-1o 8402  df-bnj13 34881  df-bnj15 34883
This theorem is referenced by:  bnj151  35066
  Copyright terms: Public domain W3C validator