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

Theorem bnj153 35376
Description: Technical lemma for bnj852 35417. 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
bnj153.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
bnj153.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj153.3 𝐷 = (ω ∖ {∅})
bnj153.4 (𝜃 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
bnj153.5 (𝜏 ↔ ∀𝑚𝐷 (𝑚 E 𝑛[𝑚 / 𝑛]𝜃))
Assertion
Ref Expression
bnj153 (𝑛 = 1o → ((𝑛𝐷𝜏) → 𝜃))
Distinct variable groups:   𝐴,𝑓,𝑖,𝑥,𝑦,𝑛   𝑅,𝑓,𝑖,𝑥,𝑦,𝑛   𝑚,𝑛
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛)   𝜓(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛)   𝜃(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛)   𝜏(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛)   𝐴(𝑚)   𝐷(𝑥, 𝑦, 𝑓, 𝑖, 𝑚, 𝑛)   𝑅(𝑚)

Proof of Theorem bnj153
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 bnj153.1 . 2 (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
2 bnj153.2 . 2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3 bnj153.3 . 2 𝐷 = (ω ∖ {∅})
4 bnj153.4 . 2 (𝜃 ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃!𝑓(𝑓 Fn 𝑛𝜑𝜓)))
5 bnj153.5 . 2 (𝜏 ↔ ∀𝑚𝐷 (𝑚 E 𝑛[𝑚 / 𝑛]𝜃))
6 biid 264 . 2 (((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)))
7 biid 264 . . . 4 ([1o / 𝑛]𝜑[1o / 𝑛]𝜑)
81, 7bnj118 35365 . . 3 ([1o / 𝑛]𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
98bicomi 227 . 2 ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ [1o / 𝑛]𝜑)
10 bnj105 35221 . . . 4 1o ∈ V
112, 10bnj92 35358 . . 3 ([1o / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
1211bicomi 227 . 2 (∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ [1o / 𝑛]𝜓)
13 biid 264 . 2 ([1o / 𝑛]𝜃[1o / 𝑛]𝜃)
14 biid 264 . 2 (((𝑅 FrSe 𝐴𝑥𝐴) → ∃𝑓(𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃𝑓(𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))))
15 biid 264 . 2 (((𝑅 FrSe 𝐴𝑥𝐴) → ∃*𝑓(𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ∃*𝑓(𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))))
16 biid 264 . . . . 5 ([1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)) ↔ [1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)))
17 biid 264 . . . . 5 ([1o / 𝑛]𝜓[1o / 𝑛]𝜓)
186, 16, 7, 17bnj121 35366 . . . 4 ([1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 1o[1o / 𝑛]𝜑[1o / 𝑛]𝜓)))
198anbi2i 635 . . . . . . 7 ((𝑓 Fn 1o[1o / 𝑛]𝜑) ↔ (𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)))
2019, 11anbi12i 640 . . . . . 6 (((𝑓 Fn 1o[1o / 𝑛]𝜑) ∧ [1o / 𝑛]𝜓) ↔ ((𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
21 df-3an 1105 . . . . . 6 ((𝑓 Fn 1o[1o / 𝑛]𝜑[1o / 𝑛]𝜓) ↔ ((𝑓 Fn 1o[1o / 𝑛]𝜑) ∧ [1o / 𝑛]𝜓))
22 df-3an 1105 . . . . . 6 ((𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ ((𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
2320, 21, 223bitr4i 306 . . . . 5 ((𝑓 Fn 1o[1o / 𝑛]𝜑[1o / 𝑛]𝜓) ↔ (𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
2423imbi2i 339 . . . 4 (((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 1o[1o / 𝑛]𝜑[1o / 𝑛]𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))))
2518, 24bitri 278 . . 3 ([1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))))
2625bicomi 227 . 2 (((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))) ↔ [1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)))
27 eqid 2762 . 2 {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} = {⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}
28 biid 264 . 2 ([{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ [{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
29 biid 264 . 2 ([{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓]𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ [{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓]𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
3026sbcbii 3798 . . 3 ([{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))) ↔ [{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)))
31 biid 264 . . . . 5 ([{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜑[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜑)
32 biid 264 . . . . 5 ([{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜓[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜓)
33 biid 264 . . . . 5 ([{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)) ↔ [{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)))
3427, 31, 32, 33, 18bnj124 35367 . . . 4 ([{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜑[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜓)))
351, 7, 31, 27bnj125 35368 . . . . . . . 8 ([{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜑 ↔ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘∅) = pred(𝑥, 𝐴, 𝑅))
3635anbi2i 635 . . . . . . 7 (({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜑) ↔ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o ∧ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘∅) = pred(𝑥, 𝐴, 𝑅)))
372, 17, 32, 27bnj126 35369 . . . . . . 7 ([{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘suc 𝑖) = 𝑦 ∈ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3836, 37anbi12i 640 . . . . . 6 ((({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜑) ∧ [{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜓) ↔ (({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o ∧ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘∅) = pred(𝑥, 𝐴, 𝑅)) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘suc 𝑖) = 𝑦 ∈ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘𝑖) pred(𝑦, 𝐴, 𝑅))))
39 df-3an 1105 . . . . . 6 (({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜑[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜓) ↔ (({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜑) ∧ [{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜓))
40 df-3an 1105 . . . . . 6 (({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o ∧ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘suc 𝑖) = 𝑦 ∈ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ (({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o ∧ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘∅) = pred(𝑥, 𝐴, 𝑅)) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘suc 𝑖) = 𝑦 ∈ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘𝑖) pred(𝑦, 𝐴, 𝑅))))
4138, 39, 403bitr4i 306 . . . . 5 (({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜑[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜓) ↔ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o ∧ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘suc 𝑖) = 𝑦 ∈ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘𝑖) pred(𝑦, 𝐴, 𝑅))))
4241imbi2i 339 . . . 4 (((𝑅 FrSe 𝐴𝑥𝐴) → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜑[{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o ∧ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘suc 𝑖) = 𝑦 ∈ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘𝑖) pred(𝑦, 𝐴, 𝑅)))))
4334, 42bitri 278 . . 3 ([{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓][1o / 𝑛]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 𝑛𝜑𝜓)) ↔ ((𝑅 FrSe 𝐴𝑥𝐴) → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o ∧ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘suc 𝑖) = 𝑦 ∈ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘𝑖) pred(𝑦, 𝐴, 𝑅)))))
4430, 43bitr2i 279 . 2 (((𝑅 FrSe 𝐴𝑥𝐴) → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} Fn 1o ∧ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘suc 𝑖) = 𝑦 ∈ ({⟨∅, pred(𝑥, 𝐴, 𝑅)⟩}‘𝑖) pred(𝑦, 𝐴, 𝑅)))) ↔ [{⟨∅, pred(𝑥, 𝐴, 𝑅)⟩} / 𝑓]((𝑅 FrSe 𝐴𝑥𝐴) → (𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))))
45 biid 264 . 2 ((𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ (𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
46 biid 264 . . . . 5 ((𝑓 Fn 1o[1o / 𝑛]𝜑[1o / 𝑛]𝜓) ↔ (𝑓 Fn 1o[1o / 𝑛]𝜑[1o / 𝑛]𝜓))
47 biid 264 . . . . 5 ([𝑔 / 𝑓](𝑓 Fn 1o[1o / 𝑛]𝜑[1o / 𝑛]𝜓) ↔ [𝑔 / 𝑓](𝑓 Fn 1o[1o / 𝑛]𝜑[1o / 𝑛]𝜓))
48 biid 264 . . . . 5 ([𝑔 / 𝑓][1o / 𝑛]𝜑[𝑔 / 𝑓][1o / 𝑛]𝜑)
49 biid 264 . . . . 5 ([𝑔 / 𝑓][1o / 𝑛]𝜓[𝑔 / 𝑓][1o / 𝑛]𝜓)
5046, 47, 48, 49bnj156 35225 . . . 4 ([𝑔 / 𝑓](𝑓 Fn 1o[1o / 𝑛]𝜑[1o / 𝑛]𝜓) ↔ (𝑔 Fn 1o[𝑔 / 𝑓][1o / 𝑛]𝜑[𝑔 / 𝑓][1o / 𝑛]𝜓))
5148, 8bnj154 35374 . . . . . . 7 ([𝑔 / 𝑓][1o / 𝑛]𝜑 ↔ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅))
5251anbi2i 635 . . . . . 6 ((𝑔 Fn 1o[𝑔 / 𝑓][1o / 𝑛]𝜑) ↔ (𝑔 Fn 1o ∧ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅)))
5317, 11bitri 278 . . . . . . 7 ([1o / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
5449, 53bnj155 35375 . . . . . 6 ([𝑔 / 𝑓][1o / 𝑛]𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅)))
5552, 54anbi12i 640 . . . . 5 (((𝑔 Fn 1o[𝑔 / 𝑓][1o / 𝑛]𝜑) ∧ [𝑔 / 𝑓][1o / 𝑛]𝜓) ↔ ((𝑔 Fn 1o ∧ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅)) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
56 df-3an 1105 . . . . 5 ((𝑔 Fn 1o[𝑔 / 𝑓][1o / 𝑛]𝜑[𝑔 / 𝑓][1o / 𝑛]𝜓) ↔ ((𝑔 Fn 1o[𝑔 / 𝑓][1o / 𝑛]𝜑) ∧ [𝑔 / 𝑓][1o / 𝑛]𝜓))
57 df-3an 1105 . . . . 5 ((𝑔 Fn 1o ∧ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ ((𝑔 Fn 1o ∧ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅)) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
5855, 56, 573bitr4i 306 . . . 4 ((𝑔 Fn 1o[𝑔 / 𝑓][1o / 𝑛]𝜑[𝑔 / 𝑓][1o / 𝑛]𝜓) ↔ (𝑔 Fn 1o ∧ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
5950, 58bitri 278 . . 3 ([𝑔 / 𝑓](𝑓 Fn 1o[1o / 𝑛]𝜑[1o / 𝑛]𝜓) ↔ (𝑔 Fn 1o ∧ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))))
6023sbcbii 3798 . . 3 ([𝑔 / 𝑓](𝑓 Fn 1o[1o / 𝑛]𝜑[1o / 𝑛]𝜓) ↔ [𝑔 / 𝑓](𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
6159, 60bitr3i 280 . 2 ((𝑔 Fn 1o ∧ (𝑔‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑔‘suc 𝑖) = 𝑦 ∈ (𝑔𝑖) pred(𝑦, 𝐴, 𝑅))) ↔ [𝑔 / 𝑓](𝑓 Fn 1o ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ ∀𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅))))
62 biid 264 . 2 ([𝑔 / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ [𝑔 / 𝑓](𝑓‘∅) = pred(𝑥, 𝐴, 𝑅))
63 biid 264 . 2 ([𝑔 / 𝑓]𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)) ↔ [𝑔 / 𝑓]𝑖 ∈ ω (suc 𝑖 ∈ 1o → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
641, 2, 3, 4, 5, 6, 9, 12, 13, 14, 15, 26, 27, 28, 29, 44, 45, 61, 62, 63bnj151 35373 1 (𝑛 = 1o → ((𝑛𝐷𝜏) → 𝜃))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wex 1812  wcel 2145  ∃*wmo 2564  ∃!weu 2595  wral 3078  [wsbc 3742  cdif 3899  c0 4282  {csn 4587  cop 4593   ciun 4954   class class class wbr 5107   E cep 5558  suc csuc 6363   Fn wfn 6532  cfv 6537  ωcom 7865  1oc1o 8451   predc-bnj14 35185   FrSe w-bnj15 35189
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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-1o 8458  df-bnj13 35188  df-bnj15 35190
This theorem is used by:  bnj852  35417
  Copyright terms: Public domain W3C validator