Theorem bnj1525 35565

Description: Technical lemma for bnj1522 35568. 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
bnj1525.1	⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1525.2	⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1525.3	⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1525.4	⊢ 𝐹 = ∪ 𝐶
bnj1525.5	⊢ (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝐻 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐻‘𝑥) = (𝐺‘⟨𝑥, (𝐻 ↾ pred(𝑥, 𝐴, 𝑅))⟩)))
bnj1525.6	⊢ (𝜓 ↔ (𝜑 ∧ 𝐹 ≠ 𝐻))

Assertion

Ref	Expression
bnj1525	⊢ (𝜓 → ∀𝑥𝜓)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐻   𝑥,𝑅   𝑥,𝑑   𝑥,𝑓

Allowed substitution hints:   𝜑(𝑥, 𝑓, 𝑑)   𝜓(𝑥, 𝑓, 𝑑)   𝐴(𝑓, 𝑑)   𝐵(𝑥, 𝑓, 𝑑)   𝐶(𝑥, 𝑓, 𝑑)   𝑅(𝑓, 𝑑)   𝐹(𝑥, 𝑓, 𝑑)   𝐺(𝑥, 𝑓, 𝑑)   𝐻(𝑓, 𝑑)   𝑌(𝑥, 𝑓, 𝑑)

Proof of Theorem bnj1525

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		bnj1525.6	. . 3 ⊢ (𝜓 ↔ (𝜑 ∧ 𝐹 ≠ 𝐻))
2		bnj1525.5	. . . . 5 ⊢ (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝐻 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐻‘𝑥) = (𝐺‘⟨𝑥, (𝐻 ↾ pred(𝑥, 𝐴, 𝑅))⟩)))
3		nfv 1947	. . . . . 6 ⊢ Ⅎ𝑥 𝑅 FrSe 𝐴
4		nfv 1947	. . . . . 6 ⊢ Ⅎ𝑥 𝐻 Fn 𝐴
5		nfra1 3288	. . . . . 6 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 (𝐻‘𝑥) = (𝐺‘⟨𝑥, (𝐻 ↾ pred(𝑥, 𝐴, 𝑅))⟩)
6	3, 4, 5	nf3an 1934	. . . . 5 ⊢ Ⅎ𝑥(𝑅 FrSe 𝐴 ∧ 𝐻 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝐻‘𝑥) = (𝐺‘⟨𝑥, (𝐻 ↾ pred(𝑥, 𝐴, 𝑅))⟩))
7	2, 6	nfxfr 1886	. . . 4 ⊢ Ⅎ𝑥𝜑
8		bnj1525.4	. . . . . 6 ⊢ 𝐹 = ∪ 𝐶
9		bnj1525.3	. . . . . . . . 9 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
10		bnj1525.1	. . . . . . . . . 10 ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
11	10	bnj1309 35518	. . . . . . . . 9 ⊢ (𝑤 ∈ 𝐵 → ∀𝑥 𝑤 ∈ 𝐵)
12	9, 11	bnj1307 35519	. . . . . . . 8 ⊢ (𝑤 ∈ 𝐶 → ∀𝑥 𝑤 ∈ 𝐶)
13	12	nfcii 2913	. . . . . . 7 ⊢ Ⅎ𝑥𝐶
14	13	nfuni 4877	. . . . . 6 ⊢ Ⅎ𝑥∪ 𝐶
15	8, 14	nfcxfr 2922	. . . . 5 ⊢ Ⅎ𝑥𝐹
16		nfcv 2924	. . . . 5 ⊢ Ⅎ𝑥𝐻
17	15, 16	nfne 3060	. . . 4 ⊢ Ⅎ𝑥 𝐹 ≠ 𝐻
18	7, 17	nfan 1932	. . 3 ⊢ Ⅎ𝑥(𝜑 ∧ 𝐹 ≠ 𝐻)
19	1, 18	nfxfr 1886	. 2 ⊢ Ⅎ𝑥𝜓
20	19	nf5ri 2233	1 ⊢ (𝜓 → ∀𝑥𝜓)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570  {cab 2740   ≠ wne 2957  ∀wral 3078  ∃wrex 3088   ⊆ wss 3902  ⟨cop 4593  ∪ cuni 4870   ↾ cres 5661   Fn wfn 6532  ‘cfv 6537   predc-bnj14 35185   FrSe w-bnj15 35189

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-uni 4871

This theorem is used by:  bnj1523  35567