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 35551
Description: Technical lemma for bnj151 35553. 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 8486 . . . . . . . . 9 1o = {∅}
32fneq2i 6637 . . . . . . . 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 6898 . . . . . . . . . 10 (𝑓‘∅) ∈ V
98elsn 4595 . . . . . . . . 9 ((𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
107, 9sylibr 237 . . . . . . . 8 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
11 0ex 5260 . . . . . . . . 9 ∅ ∈ V
12 fveq2 6885 . . . . . . . . . 10 (𝑔 = ∅ → (𝑓‘𝑔) = (𝑓‘∅))
1312eleq1d 2845 . . . . . . . . 9 (𝑔 = ∅ → ((𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)}))
1411, 13ralsn 4638 . . . . . . . 8 (∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓‘∅) ∈ { pred(𝑥, 𝐴, 𝑅)})
1510, 14sylibr 237 . . . . . . 7 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → ∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)})
16 ffnfv 7119 . . . . . . 7 (𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)} ↔ (𝑓 Fn {∅} ∧ ∀𝑔 ∈ {∅} (𝑓‘𝑔) ∈ { pred(𝑥, 𝐴, 𝑅)}))
174, 15, 16sylanbrc 595 . . . . . 6 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → 𝑓:{∅}⟶{ pred(𝑥, 𝐴, 𝑅)})
18 bnj93 35539 . . . . . . . 8 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → pred(𝑥, 𝐴, 𝑅) ∈ V)
1918adantr 486 . . . . . . 7 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) → pred(𝑥, 𝐴, 𝑅) ∈ V)
20 fsng 7138 . . . . . . 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 1959 . . 3 ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∀𝑓((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) → 𝑓 = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}))
25 mo2icl 3671 . . 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 1567   = wceq 1569   ∈ wcel 2144  ∃*wmo 2562  ∀wral 3076  Vcvv 3450  [wsbc 3738  ∅c0 4278  {csn 4584  ⟨cop 4834   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  1oc1o 8472   predc-bnj14 35365   FrSe w-bnj15 35369
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-1o 8479  df-bnj13 35368  df-bnj15 35370
This theorem is used by:  bnj151  35553
  Copyright terms: Public domain W3C validator