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

Theorem bnj1014 30738
 Description: Technical lemma for bnj69 30786. 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
bnj1014.1 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj1014.2 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj1014.13 𝐷 = (ω ∖ {∅})
bnj1014.14 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
Assertion
Ref Expression
bnj1014 ((𝑔𝐵𝑗 ∈ dom 𝑔) → (𝑔𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅))
Distinct variable groups:   𝐴,𝑓,𝑖,𝑛,𝑦   𝐷,𝑖   𝑅,𝑓,𝑖,𝑛,𝑦   𝑓,𝑋,𝑖,𝑛,𝑦   𝑓,𝑔,𝑖   𝑖,𝑗   𝜑,𝑖
Allowed substitution hints:   𝜑(𝑦,𝑓,𝑔,𝑗,𝑛)   𝜓(𝑦,𝑓,𝑔,𝑖,𝑗,𝑛)   𝐴(𝑔,𝑗)   𝐵(𝑦,𝑓,𝑔,𝑖,𝑗,𝑛)   𝐷(𝑦,𝑓,𝑔,𝑗,𝑛)   𝑅(𝑔,𝑗)   𝑋(𝑔,𝑗)

Proof of Theorem bnj1014
StepHypRef Expression
1 bnj1014.14 . . . . . . 7 𝐵 = {𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
2 nfcv 2761 . . . . . . . . 9 𝑖𝐷
3 bnj1014.1 . . . . . . . . . . 11 (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
4 bnj1014.2 . . . . . . . . . . 11 (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖𝑛 → (𝑓‘suc 𝑖) = 𝑦 ∈ (𝑓𝑖) pred(𝑦, 𝐴, 𝑅)))
53, 4bnj911 30710 . . . . . . . . . 10 ((𝑓 Fn 𝑛𝜑𝜓) → ∀𝑖(𝑓 Fn 𝑛𝜑𝜓))
65nf5i 2021 . . . . . . . . 9 𝑖(𝑓 Fn 𝑛𝜑𝜓)
72, 6nfrex 3001 . . . . . . . 8 𝑖𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)
87nfab 2765 . . . . . . 7 𝑖{𝑓 ∣ ∃𝑛𝐷 (𝑓 Fn 𝑛𝜑𝜓)}
91, 8nfcxfr 2759 . . . . . 6 𝑖𝐵
109nfcri 2755 . . . . 5 𝑖 𝑔𝐵
11 nfv 1840 . . . . 5 𝑖 𝑗 ∈ dom 𝑔
1210, 11nfan 1825 . . . 4 𝑖(𝑔𝐵𝑗 ∈ dom 𝑔)
13 nfv 1840 . . . 4 𝑖(𝑔𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)
1412, 13nfim 1822 . . 3 𝑖((𝑔𝐵𝑗 ∈ dom 𝑔) → (𝑔𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅))
1514nf5ri 2063 . 2 (((𝑔𝐵𝑗 ∈ dom 𝑔) → (𝑔𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)) → ∀𝑖((𝑔𝐵𝑗 ∈ dom 𝑔) → (𝑔𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)))
16 eleq1 2686 . . . . . 6 (𝑗 = 𝑖 → (𝑗 ∈ dom 𝑔𝑖 ∈ dom 𝑔))
1716anbi2d 739 . . . . 5 (𝑗 = 𝑖 → ((𝑔𝐵𝑗 ∈ dom 𝑔) ↔ (𝑔𝐵𝑖 ∈ dom 𝑔)))
18 fveq2 6148 . . . . . 6 (𝑗 = 𝑖 → (𝑔𝑗) = (𝑔𝑖))
1918sseq1d 3611 . . . . 5 (𝑗 = 𝑖 → ((𝑔𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅) ↔ (𝑔𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅)))
2017, 19imbi12d 334 . . . 4 (𝑗 = 𝑖 → (((𝑔𝐵𝑗 ∈ dom 𝑔) → (𝑔𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ((𝑔𝐵𝑖 ∈ dom 𝑔) → (𝑔𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))))
2120equcoms 1944 . . 3 (𝑖 = 𝑗 → (((𝑔𝐵𝑗 ∈ dom 𝑔) → (𝑔𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ((𝑔𝐵𝑖 ∈ dom 𝑔) → (𝑔𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))))
221bnj1317 30600 . . . . . . 7 (𝑔𝐵 → ∀𝑓 𝑔𝐵)
2322nf5i 2021 . . . . . 6 𝑓 𝑔𝐵
24 nfv 1840 . . . . . 6 𝑓 𝑖 ∈ dom 𝑔
2523, 24nfan 1825 . . . . 5 𝑓(𝑔𝐵𝑖 ∈ dom 𝑔)
26 nfv 1840 . . . . 5 𝑓(𝑔𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅)
2725, 26nfim 1822 . . . 4 𝑓((𝑔𝐵𝑖 ∈ dom 𝑔) → (𝑔𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
28 eleq1 2686 . . . . . 6 (𝑓 = 𝑔 → (𝑓𝐵𝑔𝐵))
29 dmeq 5284 . . . . . . 7 (𝑓 = 𝑔 → dom 𝑓 = dom 𝑔)
3029eleq2d 2684 . . . . . 6 (𝑓 = 𝑔 → (𝑖 ∈ dom 𝑓𝑖 ∈ dom 𝑔))
3128, 30anbi12d 746 . . . . 5 (𝑓 = 𝑔 → ((𝑓𝐵𝑖 ∈ dom 𝑓) ↔ (𝑔𝐵𝑖 ∈ dom 𝑔)))
32 fveq1 6147 . . . . . 6 (𝑓 = 𝑔 → (𝑓𝑖) = (𝑔𝑖))
3332sseq1d 3611 . . . . 5 (𝑓 = 𝑔 → ((𝑓𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅) ↔ (𝑔𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅)))
3431, 33imbi12d 334 . . . 4 (𝑓 = 𝑔 → (((𝑓𝐵𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅)) ↔ ((𝑔𝐵𝑖 ∈ dom 𝑔) → (𝑔𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))))
35 ssiun2 4529 . . . . 5 (𝑖 ∈ dom 𝑓 → (𝑓𝑖) ⊆ 𝑖 ∈ dom 𝑓(𝑓𝑖))
36 ssiun2 4529 . . . . . 6 (𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ 𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖))
37 bnj1014.13 . . . . . . 7 𝐷 = (ω ∖ {∅})
383, 4, 37, 1bnj882 30704 . . . . . 6 trCl(𝑋, 𝐴, 𝑅) = 𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖)
3936, 38syl6sseqr 3631 . . . . 5 (𝑓𝐵 𝑖 ∈ dom 𝑓(𝑓𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
4035, 39sylan9ssr 3597 . . . 4 ((𝑓𝐵𝑖 ∈ dom 𝑓) → (𝑓𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
4127, 34, 40chvar 2261 . . 3 ((𝑔𝐵𝑖 ∈ dom 𝑔) → (𝑔𝑖) ⊆ trCl(𝑋, 𝐴, 𝑅))
4221, 41spei 2260 . 2 𝑖((𝑔𝐵𝑗 ∈ dom 𝑔) → (𝑔𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅))
4315, 42bnj1131 30566 1 ((𝑔𝐵𝑗 ∈ dom 𝑔) → (𝑔𝑗) ⊆ trCl(𝑋, 𝐴, 𝑅))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   ∧ w3a 1036   = wceq 1480   ∈ wcel 1987  {cab 2607  ∀wral 2907  ∃wrex 2908   ∖ cdif 3552   ⊆ wss 3555  ∅c0 3891  {csn 4148  ∪ ciun 4485  dom cdm 5074  suc csuc 5684   Fn wfn 5842  ‘cfv 5847  ωcom 7012   predc-bnj14 30461   trClc-bnj18 30467 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-iun 4487  df-br 4614  df-dm 5084  df-iota 5810  df-fv 5855  df-bnj18 30468 This theorem is referenced by:  bnj1015  30739
 Copyright terms: Public domain W3C validator