Theorem bnj1245 35189

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

Assertion

Ref	Expression
bnj1245	⊢ (𝜑 → dom ℎ ⊆ 𝐴)

Distinct variable groups:   𝐴,𝑑   𝐵,𝑓,ℎ   𝑓,𝐺,ℎ   ℎ,𝑌   𝑓,𝑍   𝑓,𝑑,ℎ   𝑥,𝑓,ℎ

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

Proof of Theorem bnj1245

Step	Hyp	Ref	Expression
1		bnj1245.6	. . . 4 ⊢ (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶 ∧ (𝑔 ↾ 𝐷) ≠ (ℎ ↾ 𝐷)))
2	1	bnj1247 34983	. . 3 ⊢ (𝜑 → ℎ ∈ 𝐶)
3		bnj1245.2	. . . 4 ⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
4		bnj1245.3	. . . 4 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
5		bnj1245.8	. . . 4 ⊢ 𝑍 = ⟨𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))⟩
6		bnj1245.9	. . . 4 ⊢ 𝐾 = {ℎ ∣ ∃𝑑 ∈ 𝐵 (ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘𝑍))}
7	3, 4, 5, 6	bnj1234 35188	. . 3 ⊢ 𝐶 = 𝐾
8	2, 7	eleqtrdi 2847	. 2 ⊢ (𝜑 → ℎ ∈ 𝐾)
9	6	eqabri 2879	. . . . . 6 ⊢ (ℎ ∈ 𝐾 ↔ ∃𝑑 ∈ 𝐵 (ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘𝑍)))
10	9	bnj1238 34981	. . . . 5 ⊢ (ℎ ∈ 𝐾 → ∃𝑑 ∈ 𝐵 ℎ Fn 𝑑)
11	10	bnj1196 34969	. . . 4 ⊢ (ℎ ∈ 𝐾 → ∃𝑑(𝑑 ∈ 𝐵 ∧ ℎ Fn 𝑑))
12		bnj1245.1	. . . . . . 7 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
13	12	eqabri 2879	. . . . . 6 ⊢ (𝑑 ∈ 𝐵 ↔ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
14	13	simplbi 496	. . . . 5 ⊢ (𝑑 ∈ 𝐵 → 𝑑 ⊆ 𝐴)
15		fndm 6603	. . . . 5 ⊢ (ℎ Fn 𝑑 → dom ℎ = 𝑑)
16	14, 15	bnj1241 34982	. . . 4 ⊢ ((𝑑 ∈ 𝐵 ∧ ℎ Fn 𝑑) → dom ℎ ⊆ 𝐴)
17	11, 16	bnj593 34921	. . 3 ⊢ (ℎ ∈ 𝐾 → ∃𝑑dom ℎ ⊆ 𝐴)
18	17	bnj937 34947	. 2 ⊢ (ℎ ∈ 𝐾 → dom ℎ ⊆ 𝐴)
19	8, 18	syl 17	1 ⊢ (𝜑 → dom ℎ ⊆ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  {cab 2715   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  {crab 3401   ∩ cin 3902   ⊆ wss 3903  ⟨cop 4588   class class class wbr 5100  dom cdm 5632   ↾ cres 5634   Fn wfn 6495  ‘cfv 6500   ∧ w-bnj17 34862   predc-bnj14 34864   FrSe w-bnj15 34868

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-12 2185  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-res 5644  df-iota 6456  df-fun 6502  df-fn 6503  df-fv 6508  df-bnj17 34863

This theorem is referenced by: (None)