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

Theorem bnj207 32153
Description: Technical lemma for bnj852 32193. 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
bnj207.1 (𝜒 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
bnj207.2 (𝜑′[𝑀 / 𝑛]𝜑)
bnj207.3 (𝜓′[𝑀 / 𝑛]𝜓)
bnj207.4 (𝜒′[𝑀 / 𝑛]𝜒)
bnj207.5 𝑀 ∈ V
Assertion
Ref Expression
bnj207 (𝜒′ ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑀𝜑′𝜓′)))
Distinct variable groups:   𝐴,𝑛   𝑓,𝑀   𝑅,𝑛   𝑓,𝑛   𝑥,𝑛
Allowed substitution hints:   𝜑(𝑥,𝑓,𝑛)   𝜓(𝑥,𝑓,𝑛)   𝜒(𝑥,𝑓,𝑛)   𝐴(𝑥,𝑓)   𝑅(𝑥,𝑓)   𝑀(𝑥,𝑛)   𝜑′(𝑥,𝑓,𝑛)   𝜓′(𝑥,𝑓,𝑛)   𝜒′(𝑥,𝑓,𝑛)

Proof of Theorem bnj207
StepHypRef Expression
1 bnj207.4 . 2 (𝜒′[𝑀 / 𝑛]𝜒)
2 bnj207.1 . . . 4 (𝜒 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
32sbcbii 3829 . . 3 ([𝑀 / 𝑛]𝜒[𝑀 / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
4 bnj207.5 . . . . 5 𝑀 ∈ V
5 nfv 1915 . . . . . 6 𝑛(𝑅 FrSe 𝐴𝑥𝐴)
65sbc19.21g 3846 . . . . 5 (𝑀 ∈ V → ([𝑀 / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → [𝑀 / 𝑛]∃!𝑓(𝑓 Fn 𝑛𝜑𝜓))))
74, 6ax-mp 5 . . . 4 ([𝑀 / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → [𝑀 / 𝑛]∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
84bnj89 31991 . . . . . 6 ([𝑀 / 𝑛]∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) ↔ ∃!𝑓[𝑀 / 𝑛](𝑓 Fn 𝑛𝜑𝜓))
94bnj90 31992 . . . . . . . . 9 ([𝑀 / 𝑛]𝑓 Fn 𝑛𝑓 Fn 𝑀)
109bicomi 226 . . . . . . . 8 (𝑓 Fn 𝑀[𝑀 / 𝑛]𝑓 Fn 𝑛)
11 bnj207.2 . . . . . . . 8 (𝜑′[𝑀 / 𝑛]𝜑)
12 bnj207.3 . . . . . . . 8 (𝜓′[𝑀 / 𝑛]𝜓)
1310, 11, 12, 4bnj206 32001 . . . . . . 7 ([𝑀 / 𝑛](𝑓 Fn 𝑛𝜑𝜓) ↔ (𝑓 Fn 𝑀𝜑′𝜓′))
1413eubii 2670 . . . . . 6 (∃!𝑓[𝑀 / 𝑛](𝑓 Fn 𝑛𝜑𝜓) ↔ ∃!𝑓(𝑓 Fn 𝑀𝜑′𝜓′))
158, 14bitri 277 . . . . 5 ([𝑀 / 𝑛]∃!𝑓(𝑓 Fn 𝑛𝜑𝜓) ↔ ∃!𝑓(𝑓 Fn 𝑀𝜑′𝜓′))
1615imbi2i 338 . . . 4 (((𝑅 FrSe 𝐴𝑥𝐴) → [𝑀 / 𝑛]∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑀𝜑′𝜓′)))
177, 16bitri 277 . . 3 ([𝑀 / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑀𝜑′𝜓′)))
183, 17bitri 277 . 2 ([𝑀 / 𝑛]𝜒 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑀𝜑′𝜓′)))
191, 18bitri 277 1 (𝜒′ ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑀𝜑′𝜓′)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1083  wcel 2114  ∃!weu 2653  Vcvv 3494  [wsbc 3772   Fn wfn 6350   FrSe w-bnj15 31962
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-v 3496  df-sbc 3773  df-fn 6358
This theorem is referenced by:  bnj600  32191  bnj908  32203
  Copyright terms: Public domain W3C validator