Theorem bnj1286 31968

Description: Technical lemma for bnj60 32011. 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 31964	. . . . . . . 8 ⊢ (𝜑 → ∃𝑑 ∈ 𝐵 𝑔 Fn 𝑑)
9	8	bnj1196 31746	. . . . . . 7 ⊢ (𝜑 → ∃𝑑(𝑑 ∈ 𝐵 ∧ 𝑔 Fn 𝑑))
10	2	bnj1517 31801	. . . . . . . . 9 ⊢ (𝑑 ∈ 𝐵 → ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)
11	10	adantr 473	. . . . . . . 8 ⊢ ((𝑑 ∈ 𝐵 ∧ 𝑔 Fn 𝑑) → ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)
12		fndm 6293	. . . . . . . . . 10 ⊢ (𝑔 Fn 𝑑 → dom 𝑔 = 𝑑)
13		sseq2 3885	. . . . . . . . . . 11 ⊢ (dom 𝑔 = 𝑑 → ( pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔 ↔ pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
14	13	raleqbi1dv 3345	. . . . . . . . . 10 ⊢ (dom 𝑔 = 𝑑 → (∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔 ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
15	12, 14	syl 17	. . . . . . . . 9 ⊢ (𝑔 Fn 𝑑 → (∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔 ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
16	15	adantl 474	. . . . . . . 8 ⊢ ((𝑑 ∈ 𝐵 ∧ 𝑔 Fn 𝑑) → (∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔 ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
17	11, 16	mpbird 249	. . . . . . 7 ⊢ ((𝑑 ∈ 𝐵 ∧ 𝑔 Fn 𝑑) → ∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔)
18	9, 17	bnj593 31696	. . . . . 6 ⊢ (𝜑 → ∃𝑑∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔)
19	18	bnj937 31723	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔)
20	1, 19	bnj835 31710	. . . 4 ⊢ (𝜓 → ∀𝑥 ∈ dom 𝑔 pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔)
21	6	ssrab3 3949	. . . . . . 7 ⊢ 𝐸 ⊆ 𝐷
22	5	bnj1292 31767	. . . . . . 7 ⊢ 𝐷 ⊆ dom 𝑔
23	21, 22	sstri 3869	. . . . . 6 ⊢ 𝐸 ⊆ dom 𝑔
24	23	sseli 3856	. . . . 5 ⊢ (𝑥 ∈ 𝐸 → 𝑥 ∈ dom 𝑔)
25	1, 24	bnj836 31711	. . . 4 ⊢ (𝜓 → 𝑥 ∈ dom 𝑔)
26	20, 25	bnj1294 31769	. . 3 ⊢ (𝜓 → pred(𝑥, 𝐴, 𝑅) ⊆ dom 𝑔)
27	2, 3, 4, 5, 6, 7, 1	bnj1259 31965	. . . . . . . 8 ⊢ (𝜑 → ∃𝑑 ∈ 𝐵 ℎ Fn 𝑑)
28	27	bnj1196 31746	. . . . . . 7 ⊢ (𝜑 → ∃𝑑(𝑑 ∈ 𝐵 ∧ ℎ Fn 𝑑))
29	10	adantr 473	. . . . . . . 8 ⊢ ((𝑑 ∈ 𝐵 ∧ ℎ Fn 𝑑) → ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)
30		fndm 6293	. . . . . . . . . 10 ⊢ (ℎ Fn 𝑑 → dom ℎ = 𝑑)
31		sseq2 3885	. . . . . . . . . . 11 ⊢ (dom ℎ = 𝑑 → ( pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ ↔ pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
32	31	raleqbi1dv 3345	. . . . . . . . . 10 ⊢ (dom ℎ = 𝑑 → (∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
33	30, 32	syl 17	. . . . . . . . 9 ⊢ (ℎ Fn 𝑑 → (∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
34	33	adantl 474	. . . . . . . 8 ⊢ ((𝑑 ∈ 𝐵 ∧ ℎ Fn 𝑑) → (∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ ↔ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
35	29, 34	mpbird 249	. . . . . . 7 ⊢ ((𝑑 ∈ 𝐵 ∧ ℎ Fn 𝑑) → ∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ)
36	28, 35	bnj593 31696	. . . . . 6 ⊢ (𝜑 → ∃𝑑∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ)
37	36	bnj937 31723	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ)
38	1, 37	bnj835 31710	. . . 4 ⊢ (𝜓 → ∀𝑥 ∈ dom ℎ pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ)
39	5	bnj1293 31768	. . . . . . 7 ⊢ 𝐷 ⊆ dom ℎ
40	21, 39	sstri 3869	. . . . . 6 ⊢ 𝐸 ⊆ dom ℎ
41	40	sseli 3856	. . . . 5 ⊢ (𝑥 ∈ 𝐸 → 𝑥 ∈ dom ℎ)
42	1, 41	bnj836 31711	. . . 4 ⊢ (𝜓 → 𝑥 ∈ dom ℎ)
43	38, 42	bnj1294 31769	. . 3 ⊢ (𝜓 → pred(𝑥, 𝐴, 𝑅) ⊆ dom ℎ)
44	26, 43	ssind 4099	. 2 ⊢ (𝜓 → pred(𝑥, 𝐴, 𝑅) ⊆ (dom 𝑔 ∩ dom ℎ))
45	44, 5	syl6sseqr 3910	1 ⊢ (𝜓 → pred(𝑥, 𝐴, 𝑅) ⊆ 𝐷)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 198   ∧ wa 387   ∧ w3a 1069   = wceq 1508   ∈ wcel 2051  {cab 2760   ≠ wne 2969  ∀wral 3090  ∃wrex 3091  {crab 3094   ∩ cin 3830   ⊆ wss 3831  ⟨cop 4450   class class class wbr 4934  dom cdm 5411   ↾ cres 5413   Fn wfn 6188  ‘cfv 6193   ∧ w-bnj17 31636   predc-bnj14 31638   FrSe w-bnj15 31642

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1759  ax-4 1773  ax-5 1870  ax-6 1929  ax-7 1966  ax-8 2053  ax-9 2060  ax-10 2080  ax-11 2094  ax-12 2107  ax-ext 2752

This theorem depends on definitions:  df-bi 199  df-an 388  df-or 835  df-3an 1071  df-tru 1511  df-ex 1744  df-nf 1748  df-sb 2017  df-clab 2761  df-cleq 2773  df-clel 2848  df-nfc 2920  df-ral 3095  df-rex 3096  df-rab 3099  df-v 3419  df-dif 3834  df-un 3836  df-in 3838  df-ss 3845  df-nul 4182  df-if 4354  df-sn 4445  df-pr 4447  df-op 4451  df-uni 4718  df-br 4935  df-opab 4997  df-rel 5418  df-cnv 5419  df-co 5420  df-dm 5421  df-res 5423  df-iota 6157  df-fun 6195  df-fn 6196  df-fv 6201  df-bnj17 31637

This theorem is referenced by:  bnj1280  31969