Theorem bnj1388 33013

Description: Technical lemma for bnj60 33042. 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
bnj1388.1	⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1388.2	⊢ 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1388.3	⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1388.4	⊢ (𝜏 ↔ (𝑓 ∈ 𝐶 ∧ dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
bnj1388.5	⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
bnj1388.6	⊢ (𝜓 ↔ (𝑅 FrSe 𝐴 ∧ 𝐷 ≠ ∅))
bnj1388.7	⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
bnj1388.8	⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏)

Assertion

Ref	Expression
bnj1388	⊢ (𝜒 → ∀𝑦 ∈ pred (𝑥, 𝐴, 𝑅)∃𝑓𝜏′)

Distinct variable groups:   𝑥,𝐴,𝑦   𝐵,𝑓   𝑦,𝐷   𝑥,𝑅,𝑦   𝑓,𝑑,𝑥   𝑦,𝑓   𝜓,𝑦   𝜏,𝑦

Allowed substitution hints:   𝜓(𝑥,𝑓,𝑑)   𝜒(𝑥,𝑦,𝑓,𝑑)   𝜏(𝑥,𝑓,𝑑)   𝐴(𝑓,𝑑)   𝐵(𝑥,𝑦,𝑑)   𝐶(𝑥,𝑦,𝑓,𝑑)   𝐷(𝑥,𝑓,𝑑)   𝑅(𝑓,𝑑)   𝐺(𝑥,𝑦,𝑓,𝑑)   𝑌(𝑥,𝑦,𝑓,𝑑)   𝜏′(𝑥,𝑦,𝑓,𝑑)

Proof of Theorem bnj1388

Step	Hyp	Ref	Expression
1		bnj1388.7	. . 3 ⊢ (𝜒 ↔ (𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥))
2		nfv 1917	. . . 4 ⊢ Ⅎ𝑦𝜓
3		nfv 1917	. . . 4 ⊢ Ⅎ𝑦 𝑥 ∈ 𝐷
4		nfra1 3144	. . . 4 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥
5	2, 3, 4	nf3an 1904	. . 3 ⊢ Ⅎ𝑦(𝜓 ∧ 𝑥 ∈ 𝐷 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)
6	1, 5	nfxfr 1855	. 2 ⊢ Ⅎ𝑦𝜒
7		bnj1152 32978	. . . . . 6 ⊢ (𝑦 ∈ pred(𝑥, 𝐴, 𝑅) ↔ (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝑥))
8	7	simplbi 498	. . . . 5 ⊢ (𝑦 ∈ pred(𝑥, 𝐴, 𝑅) → 𝑦 ∈ 𝐴)
9	8	adantl 482	. . . 4 ⊢ ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → 𝑦 ∈ 𝐴)
10	7	biimpi 215	. . . . . . . . 9 ⊢ (𝑦 ∈ pred(𝑥, 𝐴, 𝑅) → (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝑥))
11	10	adantl 482	. . . . . . . 8 ⊢ ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝑥))
12	11	simprd 496	. . . . . . 7 ⊢ ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → 𝑦𝑅𝑥)
13	1	simp3bi 1146	. . . . . . . 8 ⊢ (𝜒 → ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)
14	13	adantr 481	. . . . . . 7 ⊢ ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥)
15		df-ral 3069	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦(𝑦 ∈ 𝐷 → ¬ 𝑦𝑅𝑥))
16		con2b 360	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝐷 → ¬ 𝑦𝑅𝑥) ↔ (𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷))
17	16	albii 1822	. . . . . . . . 9 ⊢ (∀𝑦(𝑦 ∈ 𝐷 → ¬ 𝑦𝑅𝑥) ↔ ∀𝑦(𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷))
18	15, 17	bitri 274	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥 ↔ ∀𝑦(𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷))
19		sp 2176	. . . . . . . . 9 ⊢ (∀𝑦(𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷) → (𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷))
20	19	impcom 408	. . . . . . . 8 ⊢ ((𝑦𝑅𝑥 ∧ ∀𝑦(𝑦𝑅𝑥 → ¬ 𝑦 ∈ 𝐷)) → ¬ 𝑦 ∈ 𝐷)
21	18, 20	sylan2b 594	. . . . . . 7 ⊢ ((𝑦𝑅𝑥 ∧ ∀𝑦 ∈ 𝐷 ¬ 𝑦𝑅𝑥) → ¬ 𝑦 ∈ 𝐷)
22	12, 14, 21	syl2anc 584	. . . . . 6 ⊢ ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → ¬ 𝑦 ∈ 𝐷)
23		bnj1388.5	. . . . . . . 8 ⊢ 𝐷 = {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏}
24	23	eleq2i 2830	. . . . . . 7 ⊢ (𝑦 ∈ 𝐷 ↔ 𝑦 ∈ {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏})
25		nfcv 2907	. . . . . . . 8 ⊢ Ⅎ𝑥𝑦
26		nfcv 2907	. . . . . . . 8 ⊢ Ⅎ𝑥𝐴
27		bnj1388.8	. . . . . . . . . . 11 ⊢ (𝜏′ ↔ [𝑦 / 𝑥]𝜏)
28		nfsbc1v 3736	. . . . . . . . . . 11 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜏
29	27, 28	nfxfr 1855	. . . . . . . . . 10 ⊢ Ⅎ𝑥𝜏′
30	29	nfex 2318	. . . . . . . . 9 ⊢ Ⅎ𝑥∃𝑓𝜏′
31	30	nfn 1860	. . . . . . . 8 ⊢ Ⅎ𝑥 ¬ ∃𝑓𝜏′
32		sbceq1a 3727	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑦 → (𝜏 ↔ [𝑦 / 𝑥]𝜏))
33	32, 27	bitr4di 289	. . . . . . . . . 10 ⊢ (𝑥 = 𝑦 → (𝜏 ↔ 𝜏′))
34	33	exbidv 1924	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → (∃𝑓𝜏 ↔ ∃𝑓𝜏′))
35	34	notbid 318	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (¬ ∃𝑓𝜏 ↔ ¬ ∃𝑓𝜏′))
36	25, 26, 31, 35	elrabf 3620	. . . . . . 7 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐴 ∣ ¬ ∃𝑓𝜏} ↔ (𝑦 ∈ 𝐴 ∧ ¬ ∃𝑓𝜏′))
37	24, 36	bitri 274	. . . . . 6 ⊢ (𝑦 ∈ 𝐷 ↔ (𝑦 ∈ 𝐴 ∧ ¬ ∃𝑓𝜏′))
38	22, 37	sylnib 328	. . . . 5 ⊢ ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → ¬ (𝑦 ∈ 𝐴 ∧ ¬ ∃𝑓𝜏′))
39		iman 402	. . . . 5 ⊢ ((𝑦 ∈ 𝐴 → ∃𝑓𝜏′) ↔ ¬ (𝑦 ∈ 𝐴 ∧ ¬ ∃𝑓𝜏′))
40	38, 39	sylibr 233	. . . 4 ⊢ ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → (𝑦 ∈ 𝐴 → ∃𝑓𝜏′))
41	9, 40	mpd 15	. . 3 ⊢ ((𝜒 ∧ 𝑦 ∈ pred(𝑥, 𝐴, 𝑅)) → ∃𝑓𝜏′)
42	41	ex 413	. 2 ⊢ (𝜒 → (𝑦 ∈ pred(𝑥, 𝐴, 𝑅) → ∃𝑓𝜏′))
43	6, 42	ralrimi 3141	1 ⊢ (𝜒 → ∀𝑦 ∈ pred (𝑥, 𝐴, 𝑅)∃𝑓𝜏′)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1086  ∀wal 1537   = wceq 1539  ∃wex 1782   ∈ wcel 2106  {cab 2715   ≠ wne 2943  ∀wral 3064  ∃wrex 3065  {crab 3068  [wsbc 3716   ∪ cun 3885   ⊆ wss 3887  ∅c0 4256  {csn 4561  ⟨cop 4567   class class class wbr 5074  dom cdm 5589   ↾ cres 5591   Fn wfn 6428  ‘cfv 6433   predc-bnj14 32667   FrSe w-bnj15 32671   trClc-bnj18 32673

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-bnj14 32668

This theorem is referenced by:  bnj1398  33014  bnj1489  33036