Theorem bnj1286 32899

Description: Technical lemma for bnj60 32942. 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
bnj1286.1	⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1286.2	⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1286.3	⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1286.4	⊢ 𝐷 = (dom 𝑔 ∩ dom ℎ)
bnj1286.5	⊢ 𝐸 = {𝑥 ∈ 𝐷 ∣ (𝑔‘𝑥) ≠ (ℎ‘𝑥)}
bnj1286.6	⊢ (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶 ∧ (𝑔 ↾ 𝐷) ≠ (ℎ ↾ 𝐷)))
bnj1286.7	⊢ (𝜓 ↔ (𝜑 ∧ 𝑥 ∈ 𝐸 ∧ ∀𝑦 ∈ 𝐸 ¬ 𝑦𝑅𝑥))

Assertion

Ref	Expression
bnj1286	⊢ (𝜓 → pred(𝑥, 𝐴, 𝑅) ⊆ 𝐷)

Distinct variable groups:   𝐴,𝑑,𝑓   𝐵,𝑓,𝑔   𝐵,ℎ,𝑓   𝑥,𝐷   𝑓,𝐺,𝑔   ℎ,𝐺   𝑅,𝑑,𝑓   𝑔,𝑌   ℎ,𝑌   𝑔,𝑑,𝑥,𝑓   ℎ,𝑑,𝑥

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑓,𝑔,ℎ,𝑑)   𝜓(𝑥,𝑦,𝑓,𝑔,ℎ,𝑑)   𝐴(𝑥,𝑦,𝑔,ℎ)   𝐵(𝑥,𝑦,𝑑)   𝐶(𝑥,𝑦,𝑓,𝑔,ℎ,𝑑)   𝐷(𝑦,𝑓,𝑔,ℎ,𝑑)   𝑅(𝑥,𝑦,𝑔,ℎ)   𝐸(𝑥,𝑦,𝑓,𝑔,ℎ,𝑑)   𝐺(𝑥,𝑦,𝑑)   𝑌(𝑥,𝑦,𝑓,𝑑)

Proof of Theorem bnj1286

Step	Hyp	Ref	Expression
1		bnj1286.7	. . . . 5 ⊢ (𝜓 ↔ (𝜑 ∧ 𝑥 ∈ 𝐸 ∧ ∀𝑦 ∈ 𝐸 ¬ 𝑦𝑅𝑥))
2		bnj1286.1	. . . . . . . . 9 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
3		bnj1286.2	. . . . . . . . 9 ⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
4		bnj1286.3	. . . . . . . . 9 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
5		bnj1286.4	. . . . . . . . 9 ⊢ 𝐷 = (dom 𝑔 ∩ dom ℎ)
6		bnj1286.5	. . . . . . . . 9 ⊢ 𝐸 = {𝑥 ∈ 𝐷 ∣ (𝑔‘𝑥) ≠ (ℎ‘𝑥)}
7		bnj1286.6	. . . . . . . . 9 ⊢ (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶 ∧ (𝑔 ↾ 𝐷) ≠ (ℎ ↾ 𝐷)))
8	2, 3, 4, 5, 6, 7, 1	bnj1256 32895	. . . . . . . 8 ⊢ (𝜑 → ∃𝑑 ∈ 𝐵 𝑔 Fn 𝑑)
9	8	bnj1196 32674	. . . . . . 7 ⊢ (𝜑 → ∃𝑑(𝑑 ∈ 𝐵 ∧ 𝑔 Fn 𝑑))
10	2	bnj1517 32730	. . . . . . . . 9 ⊢ (𝑑 ∈ 𝐵 → ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)
11	10	adantr 480	. . . . . . . 8 ⊢ ((𝑑 ∈ 𝐵 ∧ 𝑔 Fn 𝑑) → ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)
12		fndm 6520	. . . . . . . . . 10 ⊢ (𝑔 Fn 𝑑 → dom 𝑔 = 𝑑)
13		sseq2 3943	. . . . . . . . . . 11 ⊢ (dom 𝑔 = 𝑑 → ( pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔 ↔ pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
14	13	raleqbi1dv 3331	. . . . . . . . . 10 ⊢ (dom 𝑔 = 𝑑 → (∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔 ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
15	12, 14	syl 17	. . . . . . . . 9 ⊢ (𝑔 Fn 𝑑 → (∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔 ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
16	15	adantl 481	. . . . . . . 8 ⊢ ((𝑑 ∈ 𝐵 ∧ 𝑔 Fn 𝑑) → (∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔 ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
17	11, 16	mpbird 256	. . . . . . 7 ⊢ ((𝑑 ∈ 𝐵 ∧ 𝑔 Fn 𝑑) → ∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔)
18	9, 17	bnj593 32625	. . . . . 6 ⊢ (𝜑 → ∃𝑑∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔)
19	18	bnj937 32651	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔)
20	1, 19	bnj835 32639	. . . 4 ⊢ (𝜓 → ∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔)
21	6	ssrab3 4011	. . . . . . 7 ⊢ 𝐸 ⊆ 𝐷
22	5	bnj1292 32695	. . . . . . 7 ⊢ 𝐷 ⊆ dom 𝑔
23	21, 22	sstri 3926	. . . . . 6 ⊢ 𝐸 ⊆ dom 𝑔
24	23	sseli 3913	. . . . 5 ⊢ (𝑥 ∈ 𝐸 → 𝑥 ∈ dom 𝑔)
25	1, 24	bnj836 32640	. . . 4 ⊢ (𝜓 → 𝑥 ∈ dom 𝑔)
26	20, 25	bnj1294 32697	. . 3 ⊢ (𝜓 → pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔)
27	2, 3, 4, 5, 6, 7, 1	bnj1259 32896	. . . . . . . 8 ⊢ (𝜑 → ∃𝑑 ∈ 𝐵 ℎ Fn 𝑑)
28	27	bnj1196 32674	. . . . . . 7 ⊢ (𝜑 → ∃𝑑(𝑑 ∈ 𝐵 ∧ ℎ Fn 𝑑))
29	10	adantr 480	. . . . . . . 8 ⊢ ((𝑑 ∈ 𝐵 ∧ ℎ Fn 𝑑) → ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)
30		fndm 6520	. . . . . . . . . 10 ⊢ (ℎ Fn 𝑑 → dom ℎ = 𝑑)
31		sseq2 3943	. . . . . . . . . . 11 ⊢ (dom ℎ = 𝑑 → ( pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ ↔ pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
32	31	raleqbi1dv 3331	. . . . . . . . . 10 ⊢ (dom ℎ = 𝑑 → (∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
33	30, 32	syl 17	. . . . . . . . 9 ⊢ (ℎ Fn 𝑑 → (∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
34	33	adantl 481	. . . . . . . 8 ⊢ ((𝑑 ∈ 𝐵 ∧ ℎ Fn 𝑑) → (∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
35	29, 34	mpbird 256	. . . . . . 7 ⊢ ((𝑑 ∈ 𝐵 ∧ ℎ Fn 𝑑) → ∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ)
36	28, 35	bnj593 32625	. . . . . 6 ⊢ (𝜑 → ∃𝑑∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ)
37	36	bnj937 32651	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ)
38	1, 37	bnj835 32639	. . . 4 ⊢ (𝜓 → ∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ)
39	5	bnj1293 32696	. . . . . . 7 ⊢ 𝐷 ⊆ dom ℎ
40	21, 39	sstri 3926	. . . . . 6 ⊢ 𝐸 ⊆ dom ℎ
41	40	sseli 3913	. . . . 5 ⊢ (𝑥 ∈ 𝐸 → 𝑥 ∈ dom ℎ)
42	1, 41	bnj836 32640	. . . 4 ⊢ (𝜓 → 𝑥 ∈ dom ℎ)
43	38, 42	bnj1294 32697	. . 3 ⊢ (𝜓 → pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ)
44	26, 43	ssind 4163	. 2 ⊢ (𝜓 → pred(𝑥, 𝐴, 𝑅) ⊆ (dom 𝑔 ∩ dom ℎ))
45	44, 5	sseqtrrdi 3968	1 ⊢ (𝜓 → pred(𝑥, 𝐴, 𝑅) ⊆ 𝐷)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1539   ∈ wcel 2108  {cab 2715   ≠ wne 2942  ∀wral 3063  ∃wrex 3064  {crab 3067   ∩ cin 3882   ⊆ wss 3883  ⟨cop 4564   class class class wbr 5070  dom cdm 5580   ↾ cres 5582   Fn wfn 6413  ‘cfv 6418   ∧ w-bnj17 32565   predc-bnj14 32567   FrSe w-bnj15 32571

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-12 2173  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-res 5592  df-iota 6376  df-fun 6420  df-fn 6421  df-fv 6426  df-bnj17 32566

This theorem is referenced by:  bnj1280  32900