Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  msubco Structured version   Visualization version   GIF version

Theorem msubco 33994
Description: The composition of two substitutions is a substitution. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypothesis
Ref Expression
msubco.s 𝑆 = (mSubst‘𝑇)
Assertion
Ref Expression
msubco ((𝐹 ∈ ran 𝑆𝐺 ∈ ran 𝑆) → (𝐹𝐺) ∈ ran 𝑆)

Proof of Theorem msubco
Dummy variables 𝑓 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2736 . . . . 5 (mEx‘𝑇) = (mEx‘𝑇)
2 eqid 2736 . . . . 5 (mRSubst‘𝑇) = (mRSubst‘𝑇)
3 msubco.s . . . . 5 𝑆 = (mSubst‘𝑇)
41, 2, 3elmsubrn 33991 . . . 4 ran 𝑆 = ran (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩))
54eleq2i 2829 . . 3 (𝐹 ∈ ran 𝑆𝐹 ∈ ran (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩)))
6 eqid 2736 . . . 4 (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩)) = (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩))
7 fvex 6852 . . . . 5 (mEx‘𝑇) ∈ V
87mptex 7169 . . . 4 (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∈ V
96, 8elrnmpti 5913 . . 3 (𝐹 ∈ ran (𝑓 ∈ ran (mRSubst‘𝑇) ↦ (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩)) ↔ ∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩))
105, 9bitri 274 . 2 (𝐹 ∈ ran 𝑆 ↔ ∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩))
111, 2, 3elmsubrn 33991 . . . 4 ran 𝑆 = ran (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩))
1211eleq2i 2829 . . 3 (𝐺 ∈ ran 𝑆𝐺 ∈ ran (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)))
13 eqid 2736 . . . 4 (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) = (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩))
147mptex 7169 . . . 4 (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩) ∈ V
1513, 14elrnmpti 5913 . . 3 (𝐺 ∈ ran (𝑔 ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) ↔ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩))
1612, 15bitri 274 . 2 (𝐺 ∈ ran 𝑆 ↔ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩))
17 reeanv 3215 . . 3 (∃𝑓 ∈ ran (mRSubst‘𝑇)∃𝑔 ∈ ran (mRSubst‘𝑇)(𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) ↔ (∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)))
18 simpr 485 . . . . . . . . . . . 12 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → 𝑦 ∈ (mEx‘𝑇))
19 eqid 2736 . . . . . . . . . . . . 13 (mTC‘𝑇) = (mTC‘𝑇)
20 eqid 2736 . . . . . . . . . . . . 13 (mREx‘𝑇) = (mREx‘𝑇)
2119, 1, 20mexval 33965 . . . . . . . . . . . 12 (mEx‘𝑇) = ((mTC‘𝑇) × (mREx‘𝑇))
2218, 21eleqtrdi 2848 . . . . . . . . . . 11 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → 𝑦 ∈ ((mTC‘𝑇) × (mREx‘𝑇)))
23 xp1st 7949 . . . . . . . . . . 11 (𝑦 ∈ ((mTC‘𝑇) × (mREx‘𝑇)) → (1st𝑦) ∈ (mTC‘𝑇))
2422, 23syl 17 . . . . . . . . . 10 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → (1st𝑦) ∈ (mTC‘𝑇))
252, 20mrsubf 33980 . . . . . . . . . . . 12 (𝑔 ∈ ran (mRSubst‘𝑇) → 𝑔:(mREx‘𝑇)⟶(mREx‘𝑇))
2625ad2antlr 725 . . . . . . . . . . 11 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → 𝑔:(mREx‘𝑇)⟶(mREx‘𝑇))
27 xp2nd 7950 . . . . . . . . . . . 12 (𝑦 ∈ ((mTC‘𝑇) × (mREx‘𝑇)) → (2nd𝑦) ∈ (mREx‘𝑇))
2822, 27syl 17 . . . . . . . . . . 11 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → (2nd𝑦) ∈ (mREx‘𝑇))
2926, 28ffvelcdmd 7032 . . . . . . . . . 10 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → (𝑔‘(2nd𝑦)) ∈ (mREx‘𝑇))
30 opelxpi 5668 . . . . . . . . . 10 (((1st𝑦) ∈ (mTC‘𝑇) ∧ (𝑔‘(2nd𝑦)) ∈ (mREx‘𝑇)) → ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ ∈ ((mTC‘𝑇) × (mREx‘𝑇)))
3124, 29, 30syl2anc 584 . . . . . . . . 9 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ ∈ ((mTC‘𝑇) × (mREx‘𝑇)))
3231, 21eleqtrrdi 2849 . . . . . . . 8 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ ∈ (mEx‘𝑇))
33 eqidd 2737 . . . . . . . 8 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩))
34 eqidd 2737 . . . . . . . 8 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩))
35 fvex 6852 . . . . . . . . . 10 (1st𝑦) ∈ V
36 fvex 6852 . . . . . . . . . 10 (𝑔‘(2nd𝑦)) ∈ V
3735, 36op1std 7927 . . . . . . . . 9 (𝑥 = ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ → (1st𝑥) = (1st𝑦))
3835, 36op2ndd 7928 . . . . . . . . . 10 (𝑥 = ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ → (2nd𝑥) = (𝑔‘(2nd𝑦)))
3938fveq2d 6843 . . . . . . . . 9 (𝑥 = ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ → (𝑓‘(2nd𝑥)) = (𝑓‘(𝑔‘(2nd𝑦))))
4037, 39opeq12d 4836 . . . . . . . 8 (𝑥 = ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩ → ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩ = ⟨(1st𝑦), (𝑓‘(𝑔‘(2nd𝑦)))⟩)
4132, 33, 34, 40fmptco 7071 . . . . . . 7 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑓‘(𝑔‘(2nd𝑦)))⟩))
42 fvco3 6937 . . . . . . . . . 10 ((𝑔:(mREx‘𝑇)⟶(mREx‘𝑇) ∧ (2nd𝑦) ∈ (mREx‘𝑇)) → ((𝑓𝑔)‘(2nd𝑦)) = (𝑓‘(𝑔‘(2nd𝑦))))
4326, 28, 42syl2anc 584 . . . . . . . . 9 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ((𝑓𝑔)‘(2nd𝑦)) = (𝑓‘(𝑔‘(2nd𝑦))))
4443opeq2d 4835 . . . . . . . 8 (((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) ∧ 𝑦 ∈ (mEx‘𝑇)) → ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩ = ⟨(1st𝑦), (𝑓‘(𝑔‘(2nd𝑦)))⟩)
4544mpteq2dva 5203 . . . . . . 7 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑓‘(𝑔‘(2nd𝑦)))⟩))
4641, 45eqtr4d 2779 . . . . . 6 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩))
472mrsubco 33984 . . . . . . . 8 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑓𝑔) ∈ ran (mRSubst‘𝑇))
487mptex 7169 . . . . . . . 8 (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) ∈ V
49 eqid 2736 . . . . . . . . 9 ( ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩)) = ( ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩))
50 fveq1 6838 . . . . . . . . . . 11 ( = (𝑓𝑔) → (‘(2nd𝑦)) = ((𝑓𝑔)‘(2nd𝑦)))
5150opeq2d 4835 . . . . . . . . . 10 ( = (𝑓𝑔) → ⟨(1st𝑦), (‘(2nd𝑦))⟩ = ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩)
5251mpteq2dv 5205 . . . . . . . . 9 ( = (𝑓𝑔) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩) = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩))
5349, 52elrnmpt1s 5910 . . . . . . . 8 (((𝑓𝑔) ∈ ran (mRSubst‘𝑇) ∧ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) ∈ V) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) ∈ ran ( ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩)))
5447, 48, 53sylancl 586 . . . . . . 7 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) ∈ ran ( ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩)))
551, 2, 3elmsubrn 33991 . . . . . . 7 ran 𝑆 = ran ( ∈ ran (mRSubst‘𝑇) ↦ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (‘(2nd𝑦))⟩))
5654, 55eleqtrrdi 2849 . . . . . 6 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), ((𝑓𝑔)‘(2nd𝑦))⟩) ∈ ran 𝑆)
5746, 56eqeltrd 2838 . . . . 5 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) ∈ ran 𝑆)
58 coeq1 5811 . . . . . . 7 (𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) → (𝐹𝐺) = ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ 𝐺))
59 coeq2 5812 . . . . . . 7 (𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩) → ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ 𝐺) = ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)))
6058, 59sylan9eq 2796 . . . . . 6 ((𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) → (𝐹𝐺) = ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)))
6160eleq1d 2822 . . . . 5 ((𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) → ((𝐹𝐺) ∈ ran 𝑆 ↔ ((𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∘ (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) ∈ ran 𝑆))
6257, 61syl5ibrcom 246 . . . 4 ((𝑓 ∈ ran (mRSubst‘𝑇) ∧ 𝑔 ∈ ran (mRSubst‘𝑇)) → ((𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) → (𝐹𝐺) ∈ ran 𝑆))
6362rexlimivv 3194 . . 3 (∃𝑓 ∈ ran (mRSubst‘𝑇)∃𝑔 ∈ ran (mRSubst‘𝑇)(𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ 𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) → (𝐹𝐺) ∈ ran 𝑆)
6417, 63sylbir 234 . 2 ((∃𝑓 ∈ ran (mRSubst‘𝑇)𝐹 = (𝑥 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑥), (𝑓‘(2nd𝑥))⟩) ∧ ∃𝑔 ∈ ran (mRSubst‘𝑇)𝐺 = (𝑦 ∈ (mEx‘𝑇) ↦ ⟨(1st𝑦), (𝑔‘(2nd𝑦))⟩)) → (𝐹𝐺) ∈ ran 𝑆)
6510, 16, 64syl2anb 598 1 ((𝐹 ∈ ran 𝑆𝐺 ∈ ran 𝑆) → (𝐹𝐺) ∈ ran 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  wcel 2106  wrex 3071  Vcvv 3443  cop 4590  cmpt 5186   × cxp 5629  ran crn 5632  ccom 5635  wf 6489  cfv 6493  1st c1st 7915  2nd c2nd 7916  mTCcmtc 33927  mRExcmrex 33929  mExcmex 33930  mRSubstcmrsub 33933  mSubstcmsub 33934
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5240  ax-sep 5254  ax-nul 5261  ax-pow 5318  ax-pr 5382  ax-un 7668  ax-cnex 11103  ax-resscn 11104  ax-1cn 11105  ax-icn 11106  ax-addcl 11107  ax-addrcl 11108  ax-mulcl 11109  ax-mulrcl 11110  ax-mulcom 11111  ax-addass 11112  ax-mulass 11113  ax-distr 11114  ax-i2m1 11115  ax-1ne0 11116  ax-1rid 11117  ax-rnegex 11118  ax-rrecex 11119  ax-cnre 11120  ax-pre-lttri 11121  ax-pre-lttrn 11122  ax-pre-ltadd 11123  ax-pre-mulgt0 11124
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2887  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-rmo 3351  df-reu 3352  df-rab 3406  df-v 3445  df-sbc 3738  df-csb 3854  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3927  df-nul 4281  df-if 4485  df-pw 4560  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4864  df-int 4906  df-iun 4954  df-br 5104  df-opab 5166  df-mpt 5187  df-tr 5221  df-id 5529  df-eprel 5535  df-po 5543  df-so 5544  df-fr 5586  df-we 5588  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6251  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6445  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7309  df-ov 7356  df-oprab 7357  df-mpo 7358  df-om 7799  df-1st 7917  df-2nd 7918  df-frecs 8208  df-wrecs 8239  df-recs 8313  df-rdg 8352  df-1o 8408  df-er 8644  df-map 8763  df-pm 8764  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-card 9871  df-pnf 11187  df-mnf 11188  df-xr 11189  df-ltxr 11190  df-le 11191  df-sub 11383  df-neg 11384  df-nn 12150  df-2 12212  df-n0 12410  df-xnn0 12482  df-z 12496  df-uz 12760  df-fz 13417  df-fzo 13560  df-seq 13899  df-hash 14223  df-word 14395  df-lsw 14443  df-concat 14451  df-s1 14476  df-substr 14521  df-pfx 14551  df-struct 17011  df-sets 17028  df-slot 17046  df-ndx 17058  df-base 17076  df-ress 17105  df-plusg 17138  df-0g 17315  df-gsum 17316  df-mgm 18489  df-sgrp 18538  df-mnd 18549  df-mhm 18593  df-submnd 18594  df-frmd 18651  df-vrmd 18652  df-mrex 33949  df-mex 33950  df-mrsub 33953  df-msub 33954
This theorem is referenced by:  mclsppslem  34046
  Copyright terms: Public domain W3C validator