Theorem bnj1177 35703

Description: Technical lemma for bnj69 35707. 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
bnj1177.2	⊢ (𝜓 ↔ (𝑋 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑦𝑅𝑋))
bnj1177.3	⊢ 𝐶 = ( trCl(𝑋, 𝐴, 𝑅) ∩ 𝐵)
bnj1177.9	⊢ ((𝜑 ∧ 𝜓) → 𝑅 FrSe 𝐴)
bnj1177.13	⊢ ((𝜑 ∧ 𝜓) → 𝐵 ⊆ 𝐴)
bnj1177.17	⊢ ((𝜑 ∧ 𝜓) → 𝑋 ∈ 𝐴)

Assertion

Ref	Expression
bnj1177	⊢ ((𝜑 ∧ 𝜓) → (𝑅 Fr 𝐴 ∧ 𝐶 ⊆ 𝐴 ∧ 𝐶 ≠ ∅ ∧ 𝐶 ∈ V))

Proof of Theorem bnj1177

Step	Hyp	Ref	Expression
1		bnj1177.9	. . 3 ⊢ ((𝜑 ∧ 𝜓) → 𝑅 FrSe 𝐴)
2		df-bnj15 35391	. . . 4 ⊢ (𝑅 FrSe 𝐴 ↔ (𝑅 Fr 𝐴 ∧ 𝑅 Se 𝐴))
3	2	simplbi 502	. . 3 ⊢ (𝑅 FrSe 𝐴 → 𝑅 Fr 𝐴)
4	1, 3	syl 18	. 2 ⊢ ((𝜑 ∧ 𝜓) → 𝑅 Fr 𝐴)
5		bnj1177.3	. . . 4 ⊢ 𝐶 = ( trCl(𝑋, 𝐴, 𝑅) ∩ 𝐵)
6		bnj1147 35691	. . . . 5 ⊢ trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐴
7		ssinss1 4145	. . . . 5 ⊢ ( trCl(𝑋, 𝐴, 𝑅) ⊆ 𝐴 → ( trCl(𝑋, 𝐴, 𝑅) ∩ 𝐵) ⊆ 𝐴)
8	6, 7	ax-mp 5	. . . 4 ⊢ ( trCl(𝑋, 𝐴, 𝑅) ∩ 𝐵) ⊆ 𝐴
9	5, 8	eqsstri 3959	. . 3 ⊢ 𝐶 ⊆ 𝐴
10	9	a1i 11	. 2 ⊢ ((𝜑 ∧ 𝜓) → 𝐶 ⊆ 𝐴)
11		bnj1177.17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝜓) → 𝑋 ∈ 𝐴)
12		bnj906 35627	. . . . . . 7 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → pred(𝑋, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
13	1, 11, 12	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → pred(𝑋, 𝐴, 𝑅) ⊆ trCl(𝑋, 𝐴, 𝑅))
14	13	ssrind 4143	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → ( pred(𝑋, 𝐴, 𝑅) ∩ 𝐵) ⊆ ( trCl(𝑋, 𝐴, 𝑅) ∩ 𝐵))
15		bnj1177.13	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝜓) → 𝐵 ⊆ 𝐴)
16		bnj1177.2	. . . . . . . . . 10 ⊢ (𝜓 ↔ (𝑋 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑦𝑅𝑋))
17	16	simp2bi 1164	. . . . . . . . 9 ⊢ (𝜓 → 𝑦 ∈ 𝐵)
18	17	adantl 487	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝜓) → 𝑦 ∈ 𝐵)
19	15, 18	sseldd 3914	. . . . . . 7 ⊢ ((𝜑 ∧ 𝜓) → 𝑦 ∈ 𝐴)
20	16	simp3bi 1165	. . . . . . . 8 ⊢ (𝜓 → 𝑦𝑅𝑋)
21	20	adantl 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝜓) → 𝑦𝑅𝑋)
22		bnj1152 35695	. . . . . . 7 ⊢ (𝑦 ∈ pred(𝑋, 𝐴, 𝑅) ↔ (𝑦 ∈ 𝐴 ∧ 𝑦𝑅𝑋))
23	19, 21, 22	sylanbrc 595	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝑦 ∈ pred(𝑋, 𝐴, 𝑅))
24	23, 18	elind 4100	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → 𝑦 ∈ ( pred(𝑋, 𝐴, 𝑅) ∩ 𝐵))
25	14, 24	sseldd 3914	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝑦 ∈ ( trCl(𝑋, 𝐴, 𝑅) ∩ 𝐵))
26	25	ne0d 4291	. . 3 ⊢ ((𝜑 ∧ 𝜓) → ( trCl(𝑋, 𝐴, 𝑅) ∩ 𝐵) ≠ ∅)
27	5	neeq1i 3023	. . 3 ⊢ (𝐶 ≠ ∅ ↔ ( trCl(𝑋, 𝐴, 𝑅) ∩ 𝐵) ≠ ∅)
28	26, 27	sylibr 237	. 2 ⊢ ((𝜑 ∧ 𝜓) → 𝐶 ≠ ∅)
29		bnj893 35625	. . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴) → trCl(𝑋, 𝐴, 𝑅) ∈ V)
30	1, 11, 29	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ 𝜓) → trCl(𝑋, 𝐴, 𝑅) ∈ V)
31		inex1g 5283	. . . 4 ⊢ ( trCl(𝑋, 𝐴, 𝑅) ∈ V → ( trCl(𝑋, 𝐴, 𝑅) ∩ 𝐵) ∈ V)
32	5, 31	eqeltrid 2868	. . 3 ⊢ ( trCl(𝑋, 𝐴, 𝑅) ∈ V → 𝐶 ∈ V)
33	30, 32	syl 18	. 2 ⊢ ((𝜑 ∧ 𝜓) → 𝐶 ∈ V)
34	4, 10, 28, 33	bnj951 35473	1 ⊢ ((𝜑 ∧ 𝜓) → (𝑅 Fr 𝐴 ∧ 𝐶 ⊆ 𝐴 ∧ 𝐶 ≠ ∅ ∧ 𝐶 ∈ V))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281   class class class wbr 5106   Fr wfr 5605   ∧ w-bnj17 35384   predc-bnj14 35386   Se w-bnj13 35388   FrSe w-bnj15 35390   trClc-bnj18 35392

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772  ax-reg 9610  ax-inf2 9666

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-om 7899  df-1o 8501  df-bnj17 35385  df-bnj14 35387  df-bnj13 35389  df-bnj15 35391  df-bnj18 35393

This theorem is used by:  bnj1190  35705