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 30199
Description: Technical lemma for bnj151 30201. 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 1𝑜𝜑′𝜓′)))
bnj149.2 (𝜁0 ↔ (𝑓 Fn 1𝑜𝜑′𝜓′))
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 1060 . . . . . . . 8 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1𝑜𝜑′𝜓′)) → 𝑓 Fn 1𝑜)
2 df1o2 7459 . . . . . . . . 9 1𝑜 = {∅}
32fneq2i 5900 . . . . . . . 8 (𝑓 Fn 1𝑜𝑓 Fn {∅})
41, 3sylib 207 . . . . . . 7 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1𝑜𝜑′𝜓′)) → 𝑓 Fn {∅})
5 simpr2 1061 . . . . . . . . . 10 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1𝑜𝜑′𝜓′)) → 𝜑′)
6 bnj149.6 . . . . . . . . . 10 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
75, 6sylib 207 . . . . . . . . 9 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1𝑜𝜑′𝜓′)) → (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
8 fvex 6113 . . . . . . . . . 10 (𝑓‘∅) ∈ V
98elsn 4140 . . . . . . . . 9 ((𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
107, 9sylibr 223 . . . . . . . 8 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1𝑜𝜑′𝜓′)) → (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
11 0ex 4718 . . . . . . . . 9 ∅ ∈ V
12 fveq2 6103 . . . . . . . . . 10 (𝑔 = ∅ → (𝑓𝑔) = (𝑓‘∅))
1312eleq1d 2672 . . . . . . . . 9 (𝑔 = ∅ → ((𝑓𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)}))
1411, 13ralsn 4169 . . . . . . . 8 (∀𝑔 ∈ {∅} (𝑓𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
1510, 14sylibr 223 . . . . . . 7 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1𝑜𝜑′𝜓′)) → ∀𝑔 ∈ {∅} (𝑓𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)})
16 ffnfv 6295 . . . . . . 7 (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓 Fn {∅} ∧ ∀𝑔 ∈ {∅} (𝑓𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)}))
174, 15, 16sylanbrc 695 . . . . . 6 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1𝑜𝜑′𝜓′)) → 𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)})
18 bnj93 30187 . . . . . . . 8 ((𝑅 FrSe 𝐴𝑥𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V)
1918adantr 480 . . . . . . 7 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1𝑜𝜑′𝜓′)) → pred(𝑥, 𝐴, 𝑅) ∈ V)
20 fsng 6310 . . . . . . 7 ((∅ ∈ V ∧ pred(𝑥, 𝐴, 𝑅) ∈ V) → (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
2111, 19, 20sylancr 694 . . . . . 6 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1𝑜𝜑′𝜓′)) → (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
2217, 21mpbid 221 . . . . 5 (((𝑅 FrSe 𝐴𝑥𝐴) ∧ (𝑓 Fn 1𝑜𝜑′𝜓′)) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩})
2322ex 449 . . . 4 ((𝑅 FrSe 𝐴𝑥𝐴) → ((𝑓 Fn 1𝑜𝜑′𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
2423alrimiv 1842 . . 3 ((𝑅 FrSe 𝐴𝑥𝐴) → ∀𝑓((𝑓 Fn 1𝑜𝜑′𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
25 mo2icl 3352 . . 3 (∀𝑓((𝑓 Fn 1𝑜𝜑′𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}) → ∃*𝑓(𝑓 Fn 1𝑜𝜑′𝜓′))
2624, 25syl 17 . 2 ((𝑅 FrSe 𝐴𝑥𝐴) → ∃*𝑓(𝑓 Fn 1𝑜𝜑′𝜓′))
27 bnj149.1 . 2 (𝜃1 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃*𝑓(𝑓 Fn 1𝑜𝜑′𝜓′)))
2826, 27mpbir 220 1 𝜃1
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383  w3a 1031  wal 1473   = wceq 1475  wcel 1977  ∃*wmo 2459  wral 2896  Vcvv 3173  [wsbc 3402  c0 3874  {csn 4125  cop 4131   Fn wfn 5799  wf 5800  cfv 5804  1𝑜c1o 7440   predc-bnj14 30007   FrSe w-bnj15 30011
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-suc 5646  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-1o 7447  df-bnj13 30010  df-bnj15 30012
This theorem is referenced by:  bnj151  30201
  Copyright terms: Public domain W3C validator