Theorem bnj1030 35617

Description: Technical lemma for bnj69 35640. 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
bnj1030.1	⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
bnj1030.2	⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
bnj1030.3	⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
bnj1030.4	⊢ (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
bnj1030.5	⊢ (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
bnj1030.6	⊢ (𝜁 ↔ (𝑖 ∈ 𝑛 ∧ 𝑧 ∈ (𝑓‘𝑖)))
bnj1030.7	⊢ 𝐷 = (ω ∖ {∅})
bnj1030.8	⊢ 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
bnj1030.9	⊢ (𝜂 ↔ ((𝑓 ∈ 𝐾 ∧ 𝑖 ∈ dom 𝑓) → (𝑓‘𝑖) ⊆ 𝐵))
bnj1030.10	⊢ (𝜌 ↔ ∀𝑗 ∈ 𝑛 (𝑗 E 𝑖 → [𝑗 / 𝑖]𝜂))
bnj1030.11	⊢ (𝜑′ ↔ [𝑗 / 𝑖]𝜑)
bnj1030.12	⊢ (𝜓′ ↔ [𝑗 / 𝑖]𝜓)
bnj1030.13	⊢ (𝜒′ ↔ [𝑗 / 𝑖]𝜒)
bnj1030.14	⊢ (𝜃′ ↔ [𝑗 / 𝑖]𝜃)
bnj1030.15	⊢ (𝜏′ ↔ [𝑗 / 𝑖]𝜏)
bnj1030.16	⊢ (𝜁′ ↔ [𝑗 / 𝑖]𝜁)
bnj1030.17	⊢ (𝜂′ ↔ [𝑗 / 𝑖]𝜂)
bnj1030.18	⊢ (𝜎 ↔ ((𝑗 ∈ 𝑛 ∧ 𝑗 E 𝑖) → 𝜂′))
bnj1030.19	⊢ (𝜑0 ↔ (𝑖 ∈ 𝑛 ∧ 𝜎 ∧ 𝑓 ∈ 𝐾 ∧ 𝑖 ∈ dom 𝑓))

Assertion

Ref	Expression
bnj1030	⊢ ((𝜃 ∧ 𝜏) → trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐵)

Distinct variable groups:   𝐴,𝑓,𝑖,𝑗,𝑛,𝑦   𝑧,𝐴,𝑓,𝑖,𝑛   𝐵,𝑓,𝑖,𝑛,𝑦   𝑧,𝐵   𝐷,𝑖,𝑗   𝑅,𝑓,𝑖,𝑗,𝑛,𝑦   𝑧,𝑅   𝑓,𝑋,𝑖,𝑛,𝑦   𝑧,𝑋   𝜒,𝑗   𝜂,𝑗   𝜏,𝑓,𝑖,𝑗,𝑛   𝜃,𝑓,𝑖,𝑗,𝑛   𝜑,𝑖   𝜏,𝑧   𝜃,𝑧

Allowed substitution hints:   𝜑(𝑦, 𝑧, 𝑓, 𝑗, 𝑛)   𝜓(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝜒(𝑦, 𝑧, 𝑓, 𝑖, 𝑛)   𝜃(𝑦)   𝜏(𝑦)   𝜂(𝑦, 𝑧, 𝑓, 𝑖, 𝑛)   𝜁(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝜎(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝜌(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝐵(𝑗)   𝐷(𝑦, 𝑧, 𝑓, 𝑛)   𝐾(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝑋(𝑗)   𝜑′(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝜓′(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝜒′(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝜃′(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝜏′(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝜂′(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝜁′(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)   𝜑₀(𝑦, 𝑧, 𝑓, 𝑖, 𝑗, 𝑛)

Proof of Theorem bnj1030

Step	Hyp	Ref	Expression
1		bnj1030.1	. 2 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))
2		bnj1030.2	. 2 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅)))
3		bnj1030.3	. 2 ⊢ (𝜒 ↔ (𝑛 ∈ 𝐷 ∧ 𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓))
4		bnj1030.4	. 2 ⊢ (𝜃 ↔ (𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴))
5		bnj1030.5	. 2 ⊢ (𝜏 ↔ (𝐵 ∈ V ∧ TrFo(𝐵, 𝐴, 𝑅) ∧ pred(𝑋, 𝐴, 𝑅) ⊆ 𝐵))
6		bnj1030.6	. 2 ⊢ (𝜁 ↔ (𝑖 ∈ 𝑛 ∧ 𝑧 ∈ (𝑓‘𝑖)))
7		bnj1030.7	. 2 ⊢ 𝐷 = (ω ∖ {∅})
8		bnj1030.8	. 2 ⊢ 𝐾 = {𝑓 ∣ ∃𝑛 ∈ 𝐷 (𝑓 Fn 𝑛 ∧ 𝜑 ∧ 𝜓)}
9		19.23vv 1975	. . . . 5 ⊢ (∀𝑛∀𝑖((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵) ↔ (∃𝑛∃𝑖(𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵))
10	9	albii 1851	. . . 4 ⊢ (∀𝑓∀𝑛∀𝑖((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵) ↔ ∀𝑓(∃𝑛∃𝑖(𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵))
11		19.23v 1974	. . . 4 ⊢ (∀𝑓(∃𝑛∃𝑖(𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵) ↔ (∃𝑓∃𝑛∃𝑖(𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵))
12	10, 11	bitri 278	. . 3 ⊢ (∀𝑓∀𝑛∀𝑖((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵) ↔ (∃𝑓∃𝑛∃𝑖(𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵))
13		bnj1030.9	. . . . 5 ⊢ (𝜂 ↔ ((𝑓 ∈ 𝐾 ∧ 𝑖 ∈ dom 𝑓) → (𝑓‘𝑖) ⊆ 𝐵))
14	7	bnj1071 35607	. . . . . . . 8 ⊢ (𝑛 ∈ 𝐷 → E Fr 𝑛)
15	3, 14	bnj769 35393	. . . . . . 7 ⊢ (𝜒 → E Fr 𝑛)
16	15	bnj707 35386	. . . . . 6 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → E Fr 𝑛)
17		bnj1030.10	. . . . . . 7 ⊢ (𝜌 ↔ ∀𝑗 ∈ 𝑛 (𝑗 E 𝑖 → [𝑗 / 𝑖]𝜂))
18		bnj1030.17	. . . . . . 7 ⊢ (𝜂′ ↔ [𝑗 / 𝑖]𝜂)
19		bnj1030.18	. . . . . . 7 ⊢ (𝜎 ↔ ((𝑗 ∈ 𝑛 ∧ 𝑗 E 𝑖) → 𝜂′))
20		bnj1030.19	. . . . . . 7 ⊢ (𝜑0 ↔ (𝑖 ∈ 𝑛 ∧ 𝜎 ∧ 𝑓 ∈ 𝐾 ∧ 𝑖 ∈ dom 𝑓))
21	2, 8, 13, 18	bnj1123 35616	. . . . . . . . . 10 ⊢ (𝜂′ ↔ ((𝑓 ∈ 𝐾 ∧ 𝑗 ∈ dom 𝑓) → (𝑓‘𝑗) ⊆ 𝐵))
22	2, 3, 5, 7, 19, 20, 21	bnj1118 35614	. . . . . . . . 9 ⊢ ∃𝑗((𝑖 ≠ ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑓‘𝑖) ⊆ 𝐵)
23	1, 3, 5	bnj1097 35611	. . . . . . . . 9 ⊢ ((𝑖 = ∅ ∧ ((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0)) → (𝑓‘𝑖) ⊆ 𝐵)
24	22, 23	bnj1109 35417	. . . . . . . 8 ⊢ ∃𝑗(((𝜃 ∧ 𝜏 ∧ 𝜒) ∧ 𝜑0) → (𝑓‘𝑖) ⊆ 𝐵)
25	24, 2, 3	bnj1093 35610	. . . . . . 7 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → ∀𝑖∃𝑗(𝜑0 → (𝑓‘𝑖) ⊆ 𝐵))
26	13, 17, 18, 19, 20, 25	bnj1090 35609	. . . . . 6 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → ∀𝑖 ∈ 𝑛 (𝜌 → 𝜂))
27		vex 3454	. . . . . . 7 ⊢ 𝑛 ∈ V
28	27, 17	bnj110 35488	. . . . . 6 ⊢ (( E Fr 𝑛 ∧ ∀𝑖 ∈ 𝑛 (𝜌 → 𝜂)) → ∀𝑖 ∈ 𝑛 𝜂)
29	16, 26, 28	syl2anc 596	. . . . 5 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → ∀𝑖 ∈ 𝑛 𝜂)
30	4, 5, 3, 6, 13, 29, 8	bnj1121 35615	. . . 4 ⊢ ((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵)
31	30	gen2 1828	. . 3 ⊢ ∀𝑛∀𝑖((𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵)
32	12, 31	mpgbi 1830	. 2 ⊢ (∃𝑓∃𝑛∃𝑖(𝜃 ∧ 𝜏 ∧ 𝜒 ∧ 𝜁) → 𝑧 ∈ 𝐵)
33	1, 2, 3, 4, 5, 6, 7, 8, 32	bnj1034 35600	1 ⊢ ((𝜃 ∧ 𝜏) → trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐵)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738  ∀wral 3076  ∃wrex 3086  Vcvv 3450  [wsbc 3738   ⊆ wss 3895   ∖ cdif 4045  ∅c0 4278  {csn 4583  ∪ ciun 4950   class class class wbr 5102   E cep 5549   Fr wfr 5600  dom cdm 5650  suc csuc 6364   Fn wfn 6533  ‘cfv 6538  ωcom 7877   ∧ w-bnj17 35317   predc-bnj14 35319   FrSe w-bnj15 35323   trClc-bnj18 35325   TrFow-bnj19 35327

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  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-tr 5212  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fn 6541  df-fv 6546  df-om 7878  df-bnj17 35318  df-bnj18 35326  df-bnj19 35328

This theorem is used by:  bnj1124  35618