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

Theorem bnj130 35616
Description: Technical lemma for bnj151 35619. 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
bnj130.1 (𝜃 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
bnj130.2 (𝜑′ ↔ [1o / 𝑛]𝜑)
bnj130.3 (𝜓′ ↔ [1o / 𝑛]𝜓)
bnj130.4 (𝜃′ ↔ [1o / 𝑛]𝜃)
Assertion
Ref Expression
bnj130 (𝜃′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
Distinct variable groups:   𝐴,𝑛   𝑅,𝑛   𝑓,𝑛   𝑥,𝑛
Allowed substitution hints:   𝜑(𝑥, 𝑓, 𝑛)   𝜓(𝑥, 𝑓, 𝑛)   𝜃(𝑥, 𝑓, 𝑛)   𝐴(𝑥, 𝑓)   𝑅(𝑥, 𝑓)   𝜑′(𝑥, 𝑓, 𝑛)   𝜓′(𝑥, 𝑓, 𝑛)   𝜃′(𝑥, 𝑓, 𝑛)

Proof of Theorem bnj130
StepHypRef Expression
1 bnj130.1 . . 3 (𝜃 ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
21sbcbii 3797 . 2 ([1o / 𝑛]𝜃 ↔ [1o / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
3 bnj130.4 . 2 (𝜃′ ↔ [1o / 𝑛]𝜃)
4 bnj105 35467 . . . . . . . . . 10 1o ∈ V
54bnj90 35465 . . . . . . . . 9 ([1o / 𝑛]𝑓 Fn 𝑛 ↔ 𝑓 Fn 1o)
65bicomi 227 . . . . . . . 8 (𝑓 Fn 1o ↔ [1o / 𝑛]𝑓 Fn 𝑛)
7 bnj130.2 . . . . . . . 8 (𝜑′ ↔ [1o / 𝑛]𝜑)
8 bnj130.3 . . . . . . . 8 (𝜓′ ↔ [1o / 𝑛]𝜓)
96, 7, 83anbi123i 1174 . . . . . . 7 ((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ ([1o / 𝑛]𝑓 Fn 𝑛 ∧ [1o / 𝑛]𝜑 ∧ [1o / 𝑛]𝜓))
10 sbc3an 3805 . . . . . . 7 ([1o / 𝑛](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ([1o / 𝑛]𝑓 Fn 𝑛 ∧ [1o / 𝑛]𝜑 ∧ [1o / 𝑛]𝜓))
119, 10bitr4i 281 . . . . . 6 ((𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ [1o / 𝑛](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
1211eubii 2616 . . . . 5 (∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ ∃!𝑓[1o / 𝑛](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
134bnj89 35464 . . . . 5 ([1o / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓) ↔ ∃!𝑓[1o / 𝑛](𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
1412, 13bitr4i 281 . . . 4 (∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′) ↔ [1o / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
1514imbi2i 339 . . 3 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [1o / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
16 nfv 1951 . . . . 5 Ⅎ𝑛(𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴)
1716sbc19.21g 3812 . . . 4 (1o ∈ V → ([1o / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [1o / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))))
184, 17ax-mp 5 . . 3 ([1o / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)) ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → [1o / 𝑛]∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
1915, 18bitr4i 281 . 2 (((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)) ↔ [1o / 𝑛]((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)))
202, 3, 193bitr4i 306 1 (𝜃′ ↔ ((𝑅 FrSe 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃!𝑓(𝑓 Fn 1o ∧ 𝜑′ ∧ 𝜓′)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1104   ∈ wcel 2150  ∃!weu 2599  Vcvv 3453  [wsbc 3741   Fn wfn 6560  1oc1o 8506   FrSe w-bnj15 35435
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pow 5333
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-v 3455  df-sbc 3742  df-ss 3900  df-dif 4049  df-un 4153  df-nul 4281  df-pw 4561  df-sn 4588  df-suc 6393  df-fn 6568  df-1o 8513
This theorem is used by:  bnj151  35619
  Copyright terms: Public domain W3C validator