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 35485
Description: Technical lemma for bnj151 35487. 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 1213 . . . . . . . 8 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓 Fn 1o)
2 df1o2 8467 . . . . . . . . 9 1o = {∅}
32fneq2i 6629 . . . . . . . 8 (𝑓 Fn 1o ↔ 𝑓 Fn {∅})
41, 3sylib 221 . . . . . . 7 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓 Fn {∅})
5 simpr2 1214 . . . . . . . . . 10 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝜑′)
6 bnj149.6 . . . . . . . . . 10 (𝜑′ ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
75, 6sylib 221 . . . . . . . . 9 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
8 fvex 6890 . . . . . . . . . 10 (𝑓‘∅) ∈ V
98elsn 4599 . . . . . . . . 9 ((𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
107, 9sylibr 237 . . . . . . . 8 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
11 0ex 5261 . . . . . . . . 9 ∅ ∈ V
12 fveq2 6877 . . . . . . . . . 10 (𝑔 = ∅ → (𝑓‘𝑔) = (𝑓‘∅))
1312eleq1d 2846 . . . . . . . . 9 (𝑔 = ∅ → ((𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)}))
1411, 13ralsn 4642 . . . . . . . 8 (∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
1510, 14sylibr 237 . . . . . . 7 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → ∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)})
16 ffnfv 7111 . . . . . . 7 (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓 Fn {∅} ∧ ∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)}))
174, 15, 16sylanbrc 595 . . . . . 6 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)})
18 bnj93 35473 . . . . . . . 8 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V)
1918adantr 486 . . . . . . 7 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → pred(𝑥, 𝐴, 𝑅) ∈ V)
20 fsng 7130 . . . . . . 7 ((∅ ∈ V ∧ pred(𝑥, 𝐴, 𝑅) ∈ V) → (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
2111, 19, 20sylancr 599 . . . . . 6 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
2217, 21mpbid 235 . . . . 5 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩})
2322ex 418 . . . 4 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
2423alrimiv 1960 . . 3 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∀𝑓((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
25 mo2icl 3672 . . 3 (∀𝑓((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}) → ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
2624, 25syl 18 . 2 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′))
27 bnj149.1 . 2 (𝜃1 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃*𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
2826, 27mpbir 234 1 𝜃1
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∃*wmo 2563  ∀wral 3077  Vcvv 3451  [wsbc 3739  ∅c0 4279  {csn 4584  ⟨cop 4590   Fn wfn 6526  ⟶wf 6527  ‘cfv 6531  1oc1o 8453   predc-bnj14 35299   FrSe w-bnj15 35303
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-1o 8460  df-bnj13 35302  df-bnj15 35304
This theorem is used by:  bnj151  35487
  Copyright terms: Public domain W3C validator