Theorem ismfs 35536

Description: A formal system is a tuple ⟨mCN, mVR, mType, mVT, mTC, mAx⟩ such that: mCN and mVR are disjoint; mType is a function from mVR to mVT; mVT is a subset of mTC; mAx is a set of statements; and for each variable typecode, there are infinitely many variables of that type. (Contributed by Mario Carneiro, 18-Jul-2016.)

Hypotheses

Ref	Expression
ismfs.c	⊢ 𝐶 = (mCN‘𝑇)
ismfs.v	⊢ 𝑉 = (mVR‘𝑇)
ismfs.y	⊢ 𝑌 = (mType‘𝑇)
ismfs.f	⊢ 𝐹 = (mVT‘𝑇)
ismfs.k	⊢ 𝐾 = (mTC‘𝑇)
ismfs.a	⊢ 𝐴 = (mAx‘𝑇)
ismfs.s	⊢ 𝑆 = (mStat‘𝑇)

Assertion

Ref	Expression
ismfs	⊢ (𝑇 ∈ 𝑊 → (𝑇 ∈ mFS ↔ (((𝐶 ∩ 𝑉) = ∅ ∧ 𝑌:𝑉⟶𝐾) ∧ (𝐴 ⊆ 𝑆 ∧ ∀𝑣 ∈ 𝐹 ¬ (◡𝑌 “ {𝑣}) ∈ Fin))))

Distinct variable groups:   𝑣,𝐹   𝑣,𝑇

Allowed substitution hints:   𝐴(𝑣)   𝐶(𝑣)   𝑆(𝑣)   𝐾(𝑣)   𝑉(𝑣)   𝑊(𝑣)   𝑌(𝑣)

Proof of Theorem ismfs

Dummy variable 𝑡 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6858	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mCN‘𝑡) = (mCN‘𝑇))
2		ismfs.c	. . . . . . 7 ⊢ 𝐶 = (mCN‘𝑇)
3	1, 2	eqtr4di 2782	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mCN‘𝑡) = 𝐶)
4		fveq2 6858	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = (mVR‘𝑇))
5		ismfs.v	. . . . . . 7 ⊢ 𝑉 = (mVR‘𝑇)
6	4, 5	eqtr4di 2782	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mVR‘𝑡) = 𝑉)
7	3, 6	ineq12d 4184	. . . . 5 ⊢ (𝑡 = 𝑇 → ((mCN‘𝑡) ∩ (mVR‘𝑡)) = (𝐶 ∩ 𝑉))
8	7	eqeq1d 2731	. . . 4 ⊢ (𝑡 = 𝑇 → (((mCN‘𝑡) ∩ (mVR‘𝑡)) = ∅ ↔ (𝐶 ∩ 𝑉) = ∅))
9		fveq2 6858	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mType‘𝑡) = (mType‘𝑇))
10		ismfs.y	. . . . . 6 ⊢ 𝑌 = (mType‘𝑇)
11	9, 10	eqtr4di 2782	. . . . 5 ⊢ (𝑡 = 𝑇 → (mType‘𝑡) = 𝑌)
12		fveq2 6858	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mTC‘𝑡) = (mTC‘𝑇))
13		ismfs.k	. . . . . 6 ⊢ 𝐾 = (mTC‘𝑇)
14	12, 13	eqtr4di 2782	. . . . 5 ⊢ (𝑡 = 𝑇 → (mTC‘𝑡) = 𝐾)
15	11, 6, 14	feq123d 6677	. . . 4 ⊢ (𝑡 = 𝑇 → ((mType‘𝑡):(mVR‘𝑡)⟶(mTC‘𝑡) ↔ 𝑌:𝑉⟶𝐾))
16	8, 15	anbi12d 632	. . 3 ⊢ (𝑡 = 𝑇 → ((((mCN‘𝑡) ∩ (mVR‘𝑡)) = ∅ ∧ (mType‘𝑡):(mVR‘𝑡)⟶(mTC‘𝑡)) ↔ ((𝐶 ∩ 𝑉) = ∅ ∧ 𝑌:𝑉⟶𝐾)))
17		fveq2 6858	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mAx‘𝑡) = (mAx‘𝑇))
18		ismfs.a	. . . . . 6 ⊢ 𝐴 = (mAx‘𝑇)
19	17, 18	eqtr4di 2782	. . . . 5 ⊢ (𝑡 = 𝑇 → (mAx‘𝑡) = 𝐴)
20		fveq2 6858	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mStat‘𝑡) = (mStat‘𝑇))
21		ismfs.s	. . . . . 6 ⊢ 𝑆 = (mStat‘𝑇)
22	20, 21	eqtr4di 2782	. . . . 5 ⊢ (𝑡 = 𝑇 → (mStat‘𝑡) = 𝑆)
23	19, 22	sseq12d 3980	. . . 4 ⊢ (𝑡 = 𝑇 → ((mAx‘𝑡) ⊆ (mStat‘𝑡) ↔ 𝐴 ⊆ 𝑆))
24		fveq2 6858	. . . . . 6 ⊢ (𝑡 = 𝑇 → (mVT‘𝑡) = (mVT‘𝑇))
25		ismfs.f	. . . . . 6 ⊢ 𝐹 = (mVT‘𝑇)
26	24, 25	eqtr4di 2782	. . . . 5 ⊢ (𝑡 = 𝑇 → (mVT‘𝑡) = 𝐹)
27	11	cnveqd 5839	. . . . . . . 8 ⊢ (𝑡 = 𝑇 → ◡(mType‘𝑡) = ◡𝑌)
28	27	imaeq1d 6030	. . . . . . 7 ⊢ (𝑡 = 𝑇 → (◡(mType‘𝑡) “ {𝑣}) = (◡𝑌 “ {𝑣}))
29	28	eleq1d 2813	. . . . . 6 ⊢ (𝑡 = 𝑇 → ((◡(mType‘𝑡) “ {𝑣}) ∈ Fin ↔ (◡𝑌 “ {𝑣}) ∈ Fin))
30	29	notbid 318	. . . . 5 ⊢ (𝑡 = 𝑇 → (¬ (◡(mType‘𝑡) “ {𝑣}) ∈ Fin ↔ ¬ (◡𝑌 “ {𝑣}) ∈ Fin))
31	26, 30	raleqbidv 3319	. . . 4 ⊢ (𝑡 = 𝑇 → (∀𝑣 ∈ (mVT‘𝑡) ¬ (◡(mType‘𝑡) “ {𝑣}) ∈ Fin ↔ ∀𝑣 ∈ 𝐹 ¬ (◡𝑌 “ {𝑣}) ∈ Fin))
32	23, 31	anbi12d 632	. . 3 ⊢ (𝑡 = 𝑇 → (((mAx‘𝑡) ⊆ (mStat‘𝑡) ∧ ∀𝑣 ∈ (mVT‘𝑡) ¬ (◡(mType‘𝑡) “ {𝑣}) ∈ Fin) ↔ (𝐴 ⊆ 𝑆 ∧ ∀𝑣 ∈ 𝐹 ¬ (◡𝑌 “ {𝑣}) ∈ Fin)))
33	16, 32	anbi12d 632	. 2 ⊢ (𝑡 = 𝑇 → (((((mCN‘𝑡) ∩ (mVR‘𝑡)) = ∅ ∧ (mType‘𝑡):(mVR‘𝑡)⟶(mTC‘𝑡)) ∧ ((mAx‘𝑡) ⊆ (mStat‘𝑡) ∧ ∀𝑣 ∈ (mVT‘𝑡) ¬ (◡(mType‘𝑡) “ {𝑣}) ∈ Fin)) ↔ (((𝐶 ∩ 𝑉) = ∅ ∧ 𝑌:𝑉⟶𝐾) ∧ (𝐴 ⊆ 𝑆 ∧ ∀𝑣 ∈ 𝐹 ¬ (◡𝑌 “ {𝑣}) ∈ Fin))))
34		df-mfs 35483	. 2 ⊢ mFS = {𝑡 ∣ ((((mCN‘𝑡) ∩ (mVR‘𝑡)) = ∅ ∧ (mType‘𝑡):(mVR‘𝑡)⟶(mTC‘𝑡)) ∧ ((mAx‘𝑡) ⊆ (mStat‘𝑡) ∧ ∀𝑣 ∈ (mVT‘𝑡) ¬ (◡(mType‘𝑡) “ {𝑣}) ∈ Fin))}
35	33, 34	elab2g 3647	1 ⊢ (𝑇 ∈ 𝑊 → (𝑇 ∈ mFS ↔ (((𝐶 ∩ 𝑉) = ∅ ∧ 𝑌:𝑉⟶𝐾) ∧ (𝐴 ⊆ 𝑆 ∧ ∀𝑣 ∈ 𝐹 ¬ (◡𝑌 “ {𝑣}) ∈ Fin))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∀wral 3044   ∩ cin 3913   ⊆ wss 3914  ∅c0 4296  {csn 4589  ^◡ccnv 5637   “ cima 5641  ⟶wf 6507  ‘cfv 6511  Fincfn 8918  mCNcmcn 35447  mVRcmvar 35448  mTypecmty 35449  mVTcmvt 35450  mTCcmtc 35451  mAxcmax 35452  mStatcmsta 35462  mFScmfs 35463

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-br 5108  df-opab 5170  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-fv 6519  df-mfs 35483

This theorem is referenced by:  mfsdisj  35537  mtyf2  35538  maxsta  35541  mvtinf  35542